Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.05370MaRDI QIDQ5897552FDOQ5897552

Authors: Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan 

Publication date: 1 November 2006

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

Recommendations

• Algorithm Theory - SWAT 2004
• Collective tree spanners of graphs
• Collective additive tree spanners for circle graphs and polygonal graphs
• Collective tree spanners in graphs with bounded parameters
• Collective Tree Spanners and Routing in AT-free Related Graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (10)

• Easy computation of eccentricity approximating trees
• Collective tree spanners in graphs with bounded parameters
• Algorithm Theory - SWAT 2004
• Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
• Additive Spanners for Circle Graphs and Polygonal Graphs
• Collective additive tree spanners for circle graphs and polygonal graphs
• Distance-preserving subgraphs of interval graphs
• Tree spanners for bipartite graphs and probe interval graphs
• Collective Additive Tree Spanners of Homogeneously Orderable Graphs
• Collective tree spanners for unit disk graphs with applications

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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