2021
DOI: 10.48550/arxiv.2101.03574
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Beyond Helly graphs: the diameter problem on absolute retracts

Abstract: Characterizing the graph classes such that, on n-vertex m-edge graphs in the class, we can compute the diameter faster than in O(nm) time is an important research problem both in theory and in practice. We here make a new step in this direction, for some metrically defined graph classes. Specifically, a subgraph H of a graph G is called a retract of G if it is the image of some idempotent endomorphism of G. Two necessary conditions for H being a retract of G is to have H is an isometric and isochromatic subgra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 72 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?