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

Extending Partial Representations of Proper and Unit Interval Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Our results. While for many classes efficient algorithms for the representation extension problem have been found, the problem has been open for circular arc graphs for nine years [17]. We prove that RepExt(CAR) is NP-hard.…”
Section: Introductionmentioning
confidence: 98%
“…Our results. While for many classes efficient algorithms for the representation extension problem have been found, the problem has been open for circular arc graphs for nine years [17]. We prove that RepExt(CAR) is NP-hard.…”
Section: Introductionmentioning
confidence: 98%