Finding a central vertex in an HHD-free graph (Q1408816)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a central vertex in an HHD-free graph |
scientific article; zbMATH DE number 1985920
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a central vertex in an HHD-free graph |
scientific article; zbMATH DE number 1985920 |
Statements
Finding a central vertex in an HHD-free graph (English)
0 references
25 September 2003
0 references
distances
0 references
central vertex
0 references
efficient algorithms
0 references
chordal graphs
0 references
HHD-free graphs
0 references
distance-hereditary graph
0 references
house-hole-domino-free
0 references
0.8524041
0 references
0.8443254
0 references
0.84140754
0 references
0 references
0.83891845
0 references
0.8363441
0 references
0.83614403
0 references
0.83365333
0 references
