Tree-like structures in graphs: A metric point of view

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8165 LNCS, Issue , 2013, Pages 1-4

  Dragan, Feodor F ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GRAPHIC METHODS; OPTIMIZATION;

GRAPH PARAMETERS; HYPERBOLICITY; INTERNET APPLICATION; NETWORKS AND GRAPHS; OPTIMIZATION PROBLEMS; TREE-LIKE STRUCTURES; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 84893078039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-45043-3_1     Document Type: Conference Paper

References (12)

1. Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discrete Math. 8, 359-387 (1995)
2. Brandstädt, A., Chepoi, V.D., Dragan, F.F.: Distance approximating trees for chordal and dually chordal graphs. Journal of Algorithms 30, 166-184 (1999)
3. Chepoi, V.D., Dragan, F.F.: A note on distance approximating trees in graphs. European Journal of Combinatorics 21, 761-766 (2000)
4. Chepoi, V.D., Dragan, F.F., Estellon, B., Habib, M., Vaxes, Y.: Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs. In: Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG 2008), College Park, Maryland, USA, June 9-11, pp. 59-68 (2008)
5. Chepoi, V.D., Dragan, F.F., Estellon, B., Habib, M., Vaxes, Y., Xiang, Y.: Additive Spanners and Distance and Routing Labeling Schemes for δ-Hyperbolic Graphs. Algorithmica 62(3-4), 713-732 (2012)
6. Chepoi, V.D., Dragan, F.F., Newman, I., Rabinovich, Y., Vaxes, Y.: Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discr. & Comput. Geom. 47, 187-214 (2012)
7. Dourisboure, Y., Dragan, F.F., Gavoille, C., Yan, C.: Spanners for bounded treelength graphs. Theoretical. Computer Science 383, 34-44 (2007)
8. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discr. Math. 307, 2008-2029 (2007)
9. Dragan, F.F., Abu-Ata, M.: Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 194-206. Springer, Heidelberg (2013)
10. Dragan, F.F., Köhler, E.: An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Algorithmica (in print), doi:10.1007/s00453-013-9765-4
11. Dragan, F.F., Yan, C., Lomonosov, I.: Collective tree spanners of graphs. SIAM J. Discrete Math. 20, 241-260 (2006)
12. Lokshtanov, D.: On the complexity of computing tree-length. Discrete Appl. Math. 158, 820-827 (2010)