Handbook of theoretical computer science (vol. A)
Efficient 2-dimensional approximate matching of non-rectangular figures
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
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
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The parallel complexity of tree embedding problems
Journal of Algorithms
Mixed searching and proper-path-width
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing
The complexity of subgraph isomorphism for classes of partial k-trees
Theoretical Computer Science
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
SIAM Journal on Discrete Mathematics
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
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
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
On the Parameterized Complexity of Layered Graph Drawing
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
| Hi-index | 0.01 |
We present O(n3) embedding algorithms (generalizing subgraph isomorphism) for classes of graphs of bounded pathwidth, where n is the number of vertices in the graph. These include the first polynomialtime algorithm for minor containment and the first O(nc) algorithm (c a constant independent of k) for topological embedding of graphs from subclasses of partial k-trees. Of independent interest are structural properties of k-connected graphs of bounded pathwidth on which our algorithms are based. We also describe special cases which reduce to various generalizations of string matching, permitting more efficient solutions.