Finding a central vertex in an HHD-free graph
From MaRDI portal
Publication:1408816
DOI10.1016/S0166-218X(02)00419-5zbMath1022.05080MaRDI QIDQ1408816
Feodor F. Dragan, Victor Chepoi
Publication date: 25 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
distances; chordal graphs; distance-hereditary graph; efficient algorithms; central vertex; HHD-free graphs; house-hole-domino-free
Related Items
Undirected Graphs of Entanglement 2, On claw-free asteroidal triple-free graphs, Lexbfs-orderings and powers of hhd-free graphs∗
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak bipolarizable graphs
- A Helly theorem in weakly modular space
- Computation of the center and diameter of outerplanar graphs
- On the semi-perfect elimination
- A simple linear-time algorithm for computing the center of an interval graph
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- On brittle graphs
- Centers of 2–Trees
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Convexity and HHD-Free Graphs
- Dominating cliques in distance-hereditary graphs