Pages that link to "Item:Q1201267"
From MaRDI portal
The following pages link to On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267):
Displaying 13 items.
- (Q5090495) (← links)
- (Q5091018) (← links)
- Enumerating Grid Layouts of Graphs (Q5119387) (← links)
- A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773) (← links)
- FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT (Q5249050) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← 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)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6575410) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6658295) (← links)