Concepedia

The complexity of subgraph isomorphism for classes of partial k-trees

Arvind Gupta, Naomi Nishimura

Theoretical Computer Science · 1996 · 34 citations · 11 references

DOI

Concepts

References

11

Graph Theory with Applications

E. Kay, J. A. Bondy, U. S. R. Murty · Operational Research Quarterly (1970-1977) · 1977 · 3K citations

, , +12

Graph minors. II. Algorithmic aspects of tree-width

Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations

, , +14

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

, , +15

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree

Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson et al. · Journal of Algorithms · 1995 · 292 citations

, , +7

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

Hans L. Bodlaender, Ton Kloks · Journal of Algorithms · 1996 · 290 citations

, , +10