Distance Approximating Trees for Chordal and Dually Chordal Graphs
- 1 January 1999
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 30 (1) , 166-184
- https://doi.org/10.1006/jagm.1998.0962
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal GraphsSIAM Journal on Discrete Mathematics, 1997
- Distance approximating trees for chordal and dually chordal graphsPublished by Springer Nature ,1997
- Tree SpannersSIAM Journal on Discrete Mathematics, 1995
- Dually chordal graphsPublished by Springer Nature ,1994
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- There are planar graphs almost as good as the complete graphJournal of Computer and System Sciences, 1989
- Optimal simulations of tree machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961