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 48 items.
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← 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)
- A note on the subgraphs of the (\(2\times \infty \))-grid (Q960965) (← links)
- Parameterized graph cleaning problems (Q967382) (← 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)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Fixed-parameter tractability for the Tree Assembly problem (Q2232586) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- On Chen and Chen's new tree inclusion algorithm (Q2379934) (← links)
- Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- Constrained tree inclusion (Q2569419) (← links)
- Mine ’Em All: A Note on Mining All Graphs (Q2827475) (← links)
- Edge Contractions in Subclasses of Chordal Graphs (Q3010431) (← links)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
- Mineurs d'arbres avec racines (Q4858839) (← links)
- A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. (Q5090362) (← links)
- (Q5090495) (← links)
- (Q5091018) (← links)
- Enumerating Grid Layouts of Graphs (Q5119387) (← links)
- (Q5140773) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
