Pages that link to "Item:Q671437"
From MaRDI portal
The following pages link to The complexity of subgraph isomorphism for classes of partial k-trees (Q671437):
Displaying 24 items.
- Subgraph isomorphism in graph classes (Q456655) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees (Q1578418) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Neighborhood-Preserving Mapping between Trees (Q2842180) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- On the Complexity of Extracting Subtree with Keeping Distinguishability (Q2958316) (← links)
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (Q2965515) (← links)
- The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages (Q3192237) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs (Q5410645) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
