Distance-hereditary digraphs

Authors:
Martin Lätsch;Rainer Schrader
Affiliations:
Zentrum für Angewandte Informatik, Universität zu Köln, Weyertal 80, 50931 Köln, Germany;Zentrum für Angewandte Informatik, Universität zu Köln, Weyertal 80, 50931 Köln, Germany
Venue:
Journal of Discrete Algorithms
Year:
2010

Citing 8
Cited 0

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Distance-hereditary graphs, Steiner trees, and connected domination

SIAM Journal on Computing
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Almost distance-hereditary graphs

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graphs with Bounded Induced Distance

WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Centers and medians of distance-hereditary graphs

Discrete Mathematics
(k, +)-distance-hereditary graphs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extending notions from undirected graphs, we introduce directed graphs with the property that distances are preserved when taking induced subdigraphs. We characterize these distance-hereditary digraphs in terms of paths, their level structure and forbidden induced subdigraphs. Weaker requirements than the preservation of distances allow the distance to increase by a multiplicative or additive constant. For these (k,{+,*})-distance-hereditary digraphs we give characterizations and provide computational complexity results for the corresponding recognition problems.