Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.05.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2172159738 / rank | |||
Normal rank | |||
Revision as of 18:35, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Additive sparse spanners for graphs with bounded length of largest induced cycle |
scientific article |
Statements
Additive sparse spanners for graphs with bounded length of largest induced cycle (English)
0 references
29 December 2005
0 references
additive graph spanners
0 references
efficient algorithms
0 references
\(k\)-chordal graphs
0 references
distance
0 references
