An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
On the pathwidth of chordal graphs
Discrete Applied Mathematics - ARIDAM IV and V
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The Profile Minimization Problem in Trees
SIAM Journal on Computing
Triangulating graphs without asteroidal triples
Discrete Applied Mathematics
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
Graph classes: a survey
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Graph Searching and Interval Completion
SIAM Journal on Discrete Mathematics
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Theoretical Computer Science
Hi-index | 0.05 |
For a given graph G=(V,E), the interval completion problem of G is to find an edge set F such that the supergraph H = (V, E ∪ F) of G is an interval graph and |F| is minimum. It has been shown that it is equivalent to the minimum sum cut problem, the profile minimization problem and a kind of graph searching problems. Furthermore, it has applications in computational biology, archaeology, and clone fingerprinting. In this paper, we show that it is NP-complete on split graphs and propose an efficient algorithm on primitive starlike graphs.