An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037)
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: An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time |
scientific article; zbMATH DE number 7138141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time |
scientific article; zbMATH DE number 7138141 |
Statements
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (English)
0 references
28 November 2019
0 references
linear-time algorithm
0 references
chordal graphs
0 references
eccentricities
0 references
approximation
0 references
spanning trees
0 references
0.870948851108551
0 references
0.8547005653381348
0 references
0.8533386588096619
0 references
0.8441951274871826
0 references
0.7978131771087646
0 references
