Characterization and recognition of partial 3-trees
SIAM Journal on Algebraic and Discrete Methods
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
Theoretical Computer Science
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Easy problems for tree-decomposable graphs
Journal of Algorithms
Handbook of theoretical computer science (vol. A)
On the complexity of finding iso- and other morphisms for partial k-trees
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
On Linear Recognition of Tree-Width at Most Four
SIAM Journal on Discrete Mathematics
The complexity of subgraph isomorphism for classes of partial k-trees
Theoretical Computer Science
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Maximum packing for k-connected partial k-trees in polynomial time
Theoretical Computer Science - Trees in algebra and programming
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
A note on the bounded fragmentation property and its applications in network reliability
European Journal of Combinatorics
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Graph Theory With Applications
Graph Theory With Applications
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Parameterized Graph Cleaning Problems
Graph-Theoretic Concepts in Computer Science
Parameterized graph cleaning problems
Discrete Applied Mathematics
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
A polynomial algorithm for submap isomorphism of general maps
Pattern Recognition Letters
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
The subgraph isomorphism problem, that of finding a copy of one graph in another, has proved to be intractable except when certain restrictions are placed on the inputs. In this paper, we introduce a new property for graphs along with an associated graph class (a generalization on bounded degree graphs) and extend the known classes of inputs for which polynomial-time subgraph isomorphism algorithms are attainable. In particular, if the removal of any set of at most k vertices from an n-vertex graph results in O(klogn) connected components, we say that the graph is a log-bounded fragmentation graph. We present a polynomial-time algorithm for finding a subgraph of H isomorphic to a graph G when G is a log-bounded fragmentation graph and H has bounded treewidth; these results are extended to handle graphs of locally bounded treewidth (a generalization of treewidth) when G is a log-bounded fragmentation graph and has constant diameter.