scientific article; zbMATH DE number 910922
From MaRDI portal
zbMath0858.05075MaRDI QIDQ4886099
Publication date: 23 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pathsisomorphismsdiametertree decompositionplanar graphtree widthdynamic programming algorithmsubgraph isomorphismneighbourhood cover
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
The density maximization problem in graphs, On the negative cost girth problem in planar networks, On low tree-depth decompositions, Approximation of minimum weight spanners for sparse graphs, Grad and classes with bounded expansion. II: Algorithmic aspects, Guard games on graphs: keep the intruder out!, Finding and counting given length cycles, Distance measures for embedded graphs, A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs, On problems without polynomial kernels, Faster Approximate Diameter and Distance Oracles in Planar Graphs, Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time, Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
