Results 1  10
of
152
Faster subtree isomorphism
 Journal of Algorithms
, 1999
"... We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O((k 1.5 / log k)n)time algorithm for this problem, where k and n are the number of vertices in H and G, respectively. This improves over t ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O((k 1.5 / log k)n)time algorithm for this problem, where k and n are the number of vertices in H and G, respectively. This improves over
On an Algorithm of Zemlyachenko for Subtree Isomorphism
 Inform. Process. Lett
, 1998
"... Zemlyachenko's linear time algorithm for free tree isomorphism is unique in that it also partitions the set of rooted subtrees of a given rooted tree into isomorphism equivalence classes. Unfortunately, his algorithm is very hard to follow. In this note, we use modern data structures to explain ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Zemlyachenko's linear time algorithm for free tree isomorphism is unique in that it also partitions the set of rooted subtrees of a given rooted tree into isomorphism equivalence classes. Unfortunately, his algorithm is very hard to follow. In this note, we use modern data structures
Comprehensive isomorphic subtree enumeration
 In CASES ’08: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
, 2008
"... A fundamental problem in program analysis and optimization concerns the discovery of structural similarities between different sections of a given program and/or across different programs. Specifically, there is a need to find topologically identical segments within compiler intermediate represen ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
representations (IRs). Such topological isomorphism has many applications. For example, finding isomorphic subtrees within different expression trees points to common computational resources that can be shared when targeting applicationspecific hardware. Isomorphism in the controlflow graph can be used
Subtree Isomorphism is in DLOG for Nested Trees
 Int. J. of Foundations of Computer Science
, 1995
"... This research note shows subtree isomorphism is in DLOG, and hence NC 2 , for nested trees. To our knowledge this result provides the first interesting class of trees for which the problem is in a nonrandomized version of NC. We also show that one can determine whether or not an arbitrary tree is ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This research note shows subtree isomorphism is in DLOG, and hence NC 2 , for nested trees. To our knowledge this result provides the first interesting class of trees for which the problem is in a nonrandomized version of NC. We also show that one can determine whether or not an arbitrary tree
Approximating the Maximum Isomorphic Agreement Subtree is Hard
"... The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phylogenies. More precisely MIT allows to provide a subset of the species such that the exact distances between species in ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phylogenies. More precisely MIT allows to provide a subset of the species such that the exact distances between species
Fast subtree kernels on graphs
"... In this article, we propose fast subtree kernels on graphs. On graphs with n nodes and m edges and maximum degree d, these kernels comparing subtrees of height h can be computed in O(mh), whereas the classic subtree kernel by Ramon & Gärtner scales as O(n 2 4 d h). Key to this efficiency is the ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
is the observation that the WeisfeilerLehman test of isomorphism from graph theory elegantly computes a subtree kernel as a byproduct. Our fast subtree kernels can deal with labeled graphs, scale up easily to large graphs and outperform stateoftheart graph kernels on several classification benchmark datasets
The Wirthmüller Isomorphism Revisited
 THEORY AND APPLICATIONS OF CATEGORIES
, 2003
"... We show how the formal Wirthmüller isomorphism theorem proven in [2] simplifies the proof of the Wirthmüller isomorphism in equivariant stable homotopy theory. Other examples ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We show how the formal Wirthmüller isomorphism theorem proven in [2] simplifies the proof of the Wirthmüller isomorphism in equivariant stable homotopy theory. Other examples
PLANAR SUBGRAPH ISOMORPHISM REVISITED
, 2009
"... Ten years after Eppstein’s results on planar subgraph isomorphism for ksized patterns, we improve the exponential term of the running time 2 O(k log k) · n of Eppstein’s algorithm to 2 O(k) (keeping the term in n linear!) Next to deciding subgraph isomorphism, we can construct a solution and enume ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Ten years after Eppstein’s results on planar subgraph isomorphism for ksized patterns, we improve the exponential term of the running time 2 O(k log k) · n of Eppstein’s algorithm to 2 O(k) (keeping the term in n linear!) Next to deciding subgraph isomorphism, we can construct a solution
Contents THE WIRTHMÜLLER ISOMORPHISM REVISITED
"... ABSTRACT. We show how the formal Wirthmüller isomorphism theorem proven in [2] simplifies the proof of the Wirthmüller isomorphism in equivariant stable homotopy theory. ..."
Abstract
 Add to MetaCart
ABSTRACT. We show how the formal Wirthmüller isomorphism theorem proven in [2] simplifies the proof of the Wirthmüller isomorphism in equivariant stable homotopy theory.
THE WIRTHMÜLLER ISOMORPHISM REVISITED
, 2002
"... Abstract. We show how the formal Wirthmüller isomorphism theorem proven in [2] simplifies the proof of the Wirthmüller isomorphism in equivariant stable homotopy theory. Other examples from equivariant stable homotopy theory show that the hypotheses of the formal Wirthmüller and formal Grothendieck ..."
Abstract
 Add to MetaCart
Abstract. We show how the formal Wirthmüller isomorphism theorem proven in [2] simplifies the proof of the Wirthmüller isomorphism in equivariant stable homotopy theory. Other examples from equivariant stable homotopy theory show that the hypotheses of the formal Wirthmüller and formal Grothendieck
Results 1  10
of
152