Computation of the center and diameter of outerplanar graphs
From MaRDI portal
Publication:1142786
DOI10.1016/0166-218X(80)90039-6zbMath0441.05034MaRDI QIDQ1142786
Arthur M. Farley, Andrzej Proskurowski
Publication date: 1980
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (22)
The degree-diameter problem for outerplanar graphs ⋮ Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ A simple linear-time algorithm for computing the center of an interval graph ⋮ A faster diameter problem algorithm for a chordal graph, with a connection to its center problem ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Computation of the center and diameter of outerplanar graphs ⋮ Computation of diameter, radius and center of permutation graphs ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Unnamed Item ⋮ Finding a central vertex in an HHD-free graph ⋮ Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph ⋮ Algorithm on rainbow connection for maximal outerplanar graphs ⋮ Diameter determination on restricted graph families ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees ⋮ Centers of maximal outerplanar graphs ⋮ Unnamed Item ⋮ On powers and centers of chordal graphs ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees ⋮ On some optimization problems on \(k\)-trees and partial \(k\)-trees
Cites Work
This page was built for publication: Computation of the center and diameter of outerplanar graphs
