subtree isomorphism
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 2)

H-INDEX

8
(FIVE YEARS 0)

2018 ◽  
Vol 14 (3) ◽  
pp. 1-23 ◽  
Author(s):  
Amir Abboud ◽  
Arturs Backurs ◽  
Thomas Dueholm Hansen ◽  
Virginia Vassilevska Williams ◽  
Or Zamir
Keyword(s):  

Author(s):  
Amir Abboud ◽  
Arturs Backurs ◽  
Thomas Dueholm Hansen ◽  
Virginia Vassilevska Williams ◽  
Or Zamir
Keyword(s):  

Author(s):  
Phillip B. Gibbons ◽  
Gary L. Miller ◽  
Richard M. Karp ◽  
Danny Soroker
Keyword(s):  

1999 ◽  
Vol 33 (2) ◽  
pp. 267-280 ◽  
Author(s):  
Ron Shamir ◽  
Dekel Tsur
Keyword(s):  

1999 ◽  
Vol 70 (3) ◽  
pp. 141-146 ◽  
Author(s):  
Yefim Dinitz ◽  
Alon Itai ◽  
Michael Rodeh
Keyword(s):  

1996 ◽  
Vol 07 (02) ◽  
pp. 161-167 ◽  
Author(s):  
RAYMOND GREENLAW

This research shows subtree isomorphism is in DLOG, and hence [Formula: see text], for nested trees. To our knowledge this result provides the first interesting class of trees for which the problem is in a non-randomized version of [Formula: see text]. We also show that one can determine whether or not an arbitrary tree is a nested tree in DLOG.


Sign in / Sign up

Export Citation Format

Share Document