Additive spanners for k-chordal graphs

DOI10.1007/3-540-44849-7_16MaRDI QIDQ4437500zbMATH OpenFDO

Authors Victor Chepoi, Feodor F. Dragan, Chenyu Yan

Publication date 2 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530096.htm

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Additive sparse spanners for graphs with bounded length of largest induced cycle
• Structural Information and Communication Complexity
• Spanners for bounded tree-length graphs
• Additive spanners: a simple construction
• Additive spanners in nearly quadratic time

Cited in

(10)

• On 2-detour subgraphs of the hypercube
• Spanners for bounded tree-length graphs
• Additive sparse spanners for graphs with bounded length of largest induced cycle
• Network flow spanners
• Onk-detour subgraphs of hypercubes
• Additive Tree Spanners
• Graphs with small additive stretch number
• Additive graph spanners
• Structural Information and Communication Complexity
• Collective tree spanners in graphs with bounded parameters

This page was built for publication: Additive spanners for \(k\)-chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437500)