Subgraph Isomorphism in Planar Graphs and Related Problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An approach to the subgraph homeomorphism problem
- A note on the bounded fragmentation property and its applications in network reliability
- Chordal embeddings of planar graphs
- On the complexity of submap isomorphism and maximum common submap problems
- Are unique subgraphs not easier to find?
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- A layer-decomposition with degree method for subgraphs recognition problem.
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Cleaning interval graphs
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Faster approximate diameter and distance oracles in planar graphs
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
- Faster algorithms for counting subgraphs in sparse graphs
- Notes on tree- and path-chromatic number
- Plane graphs of diameter two are 2-optimal
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- The complexity of multiple handed self-assembly
- An improved planar graph product structure theorem
- On fractional fragility rates of graph classes
- 3-list-coloring graphs of girth at least five on surfaces
- Algorithms by layer-decomposition for the subgraph recognition problem with attributes
- Parameterized counting of trees, forests and matroid bases
- Layered separators in minor-closed graph classes with applications
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Obtaining a planar graph by vertex deletion
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
- Counting subgraphs in relational event graphs
- Large independent sets in subquartic planar graphs
- Computing the overlaps of two maps
- Unique subgraphs are not easier to find
- Surface split decompositions and subgraph isomorphism in graphs on surfaces
- What's next? Future directions in parameterized complexity
- Planar subgraph isomorphism revisited
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Graph-based generation of referring expressions
- Computing and Drawing Isomorphic Subgraphs
- Algorithm and Experiments in Testing Planar Graphs for Isomorphism
- Treewidth of planar graphs: connections with duality
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Obtaining a Planar Graph by Vertex Deletion
- A Polynomial Algorithm for Submap Isomorphism
- scientific article; zbMATH DE number 3963193 (Why is no real title available?)
- scientific article; zbMATH DE number 4049079 (Why is no real title available?)
- scientific article; zbMATH DE number 4072379 (Why is no real title available?)
- Polynomial algorithms for open plane graph and subgraph isomorphisms
- Feature-based 3D morphing based on geometrically constrained spherical parameterization
- scientific article; zbMATH DE number 1974109 (Why is no real title available?)
- Extended dynamic subgraph statistics using h-index parameterized data structures
- scientific article; zbMATH DE number 1759547 (Why is no real title available?)
- Hyperbolic families and coloring graphs on surfaces
- Subgraph isomorphism in graph classes
- scientific article; zbMATH DE number 1929947 (Why is no real title available?)
- Counting and sampling minimum cuts in genus g graphs
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- On triangulating \(k\)-outerplanar graphs
- scientific article; zbMATH DE number 910922 (Why is no real title available?)
- scientific article; zbMATH DE number 6146491 (Why is no real title available?)
- On the complexity of submap isomorphism
- Approximation algorithms for min-distance problems
- Detecting and counting small patterns in planar graphs in subexponential parameterized time
- Shortest-path queries in static networks
- Six-Critical Graphs on the Klein Bottle
- Parameterized Graph Cleaning Problems
- Coloring Triangle-Free Graphs on Surfaces
- On the \(\mathrm{AC}^0\) complexity of subgraph isomorphism
- Exact distance oracles for planar graphs
- A polynomial-time approximation scheme for planar multiway cut
- Global minimum cuts in surface embedded graphs
- Slightly superexponential parameterized problems
- scientific article; zbMATH DE number 4189751 (Why is no real title available?)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- Minimum Cuts in Surface Graphs
- Subgraph isomorphism on graph classes that exclude a substructure
- Quasipolynomiality of the Smallest Missing Induced Subgraph
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
- Approximating sparse quadratic programs
- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time
- Faster parameterized algorithms for minor containment
- Twin-width. III: Max independent set, min dominating set, and coloring
- Product structure of graphs with an excluded minor
- A convex relaxation bound for subgraph isomorphism
- On computing vertex connectivity of 1-planar graphs
- Join sampling under acyclic degree constraints and (cyclic) subgraph sampling
- Subgraph enumeration in optimal I/O complexity
- Join and subgraph sampling under degree constraints
- Improved outerplanarity bounds for planar graphs
- Five-coloring graphs on the Klein bottle
- Approximation algorithms for min-distance problems in DAGs
- A parameterized algorithm for vertex and edge connectivity of embedded graphs
- Robust contraction decomposition for minor-free graphs and its applications
- Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
- On low tree-depth decompositions
- Digraph measures: Kelly decompositions, games, and orderings
- Parameterized graph cleaning problems
- Dynamic programming and planarity: improved tree-decomposition based algorithms
This page was built for publication: Subgraph Isomorphism in Planar Graphs and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4505015)
