Pages that link to "Item:Q4505015"
From MaRDI portal
The following pages link to Subgraph Isomorphism in Planar Graphs and Related Problems (Q4505015):
Displaying 50 items.
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- Feature-based 3D morphing based on geometrically constrained spherical parameterization (Q426180) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Five-coloring graphs on the Klein bottle (Q713974) (← 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)
- On low tree-depth decompositions (Q897253) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- A note on the bounded fragmentation property and its applications in network reliability (Q1413235) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- A layer-decomposition with degree method for subgraphs recognition problem. (Q1811453) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Plane graphs of diameter two are 2-optimal (Q2101995) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- The complexity of multiple handed self-assembly (Q2152075) (← links)
- An improved planar graph product structure theorem (Q2152790) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
- Algorithms by layer-decomposition for the subgraph recognition problem with attributes (Q2386613) (← links)
- Parameterized counting of trees, forests and matroid bases (Q2399367) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm (Q2664564) (← links)
- Counting Subgraphs in Relational Event Graphs (Q2803823) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
