Characterization and recognition of partial 3-trees
SIAM Journal on Algebraic and Discrete Methods
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
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
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
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
Problems Easy for Tree-Decomposable Graphs (Extended Abstract)
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
Graph Theory With Applications
Graph Theory With Applications
A note on the bounded fragmentation property and its applications in network reliability
European Journal of Combinatorics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
| 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 (a generalization on bounded degree) 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(k log n) 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.