scientific article; zbMATH DE number 910922

zbMATH Open0858.05075MaRDI QIDQ4886099FDOQ4886099

Authors: David Eppstein 

Publication date: 23 March 1997

Title of this publication is not available (Why is that?)

Recommendations

• Subgraph Isomorphism in Planar Graphs and Related Problems
• Planar subgraph isomorphism revisited
• Faster algorithms for finding and counting subgraphs
• Surface split decompositions and subgraph isomorphism in graphs on surfaces
• Graph minors. II. Algorithmic aspects of tree-width

zbMATH Keywords

pathsdiameterdynamic programming algorithmplanar graphisomorphismssubgraph isomorphismtree decompositiontree widthneighbourhood cover

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Paths and cycles (05C38)

Cited In (26)

• Title not available (Why is that?)
• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
• Guard games on graphs: keep the intruder out!
• Title not available (Why is that?)
• On MAX-SAT with cardinality constraint
• Finding and counting given length cycles
• Subgraph isomorphism for biconnected outerplanar graphs in cubic time
• Surface split decompositions and subgraph isomorphism in graphs on surfaces
• On problems without polynomial kernels
• A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
• Planar subgraph isomorphism revisited
• Computing and Drawing Isomorphic Subgraphs
• On the negative cost girth problem in planar networks
• Grad and classes with bounded expansion. II: Algorithmic aspects
• On low tree-depth decompositions
• Title not available (Why is that?)
• Distance measures for embedded graphs
• Algorithms by layer-decomposition for the subgraph recognition problem with attributes
• Approximation of minimum weight spanners for sparse graphs
• On MAX-SAT with cardinality constraint
• A layer-decomposition with degree method for subgraphs recognition problem.
• Faster Approximate Diameter and Distance Oracles in Planar Graphs
• Title not available (Why is that?)
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time
• The density maximization problem in graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886099)