Homogeneously orderable graphs

Authors:
Andreas Brandstädt;Feodor F. Dragan;Falk Nicolai
Affiliations:
Univ. Rostock, Rostock, Germany;Moldova State Univ., Chisinau, Moldova;Gerhard-Mercator-Univ.-GH-Duisburg, Duisburg, Germany
Venue:
Theoretical Computer Science
Year:
1997

On compact and efficient routing in certain graph classes

Discrete Applied Mathematics
Collective additive tree spanners of homogeneously orderable graphs

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Generalized powers of graphs and their algorithmic use

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Recognizing HHDS-free graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On compact and efficient routing in certain graph classes

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Hi-index	5.23