Complexity of approximating the oriented diameter of chordal graphs (Q4459604)
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: Complexity of approximating the oriented diameter of chordal graphs |
scientific article; zbMATH DE number 2062940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of approximating the oriented diameter of chordal graphs |
scientific article; zbMATH DE number 2062940 |
Statements
Complexity of approximating the oriented diameter of chordal graphs (English)
0 references
29 March 2004
0 references
algorithms
0 references
chordal graphs
0 references
oriented diameter
0 references
0 references
0.89180505
0 references
0.89142096
0 references
0.89142096
0 references
0 references
0.8897913
0 references
0.8883894
0 references
