scientific article; zbMATH DE number 1979496

MaRDI QIDQ4425951zbMATH OpenFDO

Authors Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le

Publication date 14 September 2003

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tree spanners on chordal graphs: complexity and algorithms
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
• Tree Spanners
• scientific article; zbMATH DE number 1262806
• An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs

Cited in

(14)

• An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
• Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
• scientific article; zbMATH DE number 804636 (Why is no real title available?)
• Tree spanners for bipartite graphs and probe interval graphs.
• Tree spanners of bounded degree graphs
• Tree \(t\)-spanners in outerplanar graphs via supply demand partition
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
• On tree-\(t\)-spanners in graphs
• Tree Spanners
• An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
• Additive sparse spanners for graphs with bounded length of largest induced cycle
• Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
• Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently
• Tree spanners on chordal graphs: complexity and algorithms

This page was built for publication:

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