Extending Partial Representations of Proper and Unit Interval Graphs
- 25 February 2016
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 77 (4) , 1071-1104
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Science Foundation (FR) (F.R.S.-FNRS - EUROGIGA NR 13604)
- GAČR (GIG/11/E023, GIG/11/E023)
- GAČR (14-14179S)
- Czech Ministry of Education, Youth and Sports (LO1506)
- European Social Fund Plus (NEXLIZ - CZ.1.07/2.3.00/30.0038)
This publication has 26 references indexed in Scilit:
- The LBFS Structure and Recognition of Interval GraphsSIAM Journal on Discrete Mathematics, 2010
- Faster Integer MultiplicationSIAM Journal on Computing, 2009
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWINGInternational Journal of Foundations of Computer Science, 2006
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval GraphsSIAM Journal on Computing, 1996
- Simple linear time recognition of unit interval graphsInformation Processing Letters, 1995
- Synthetic description of a semiorderDiscrete Applied Mathematics, 1991
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964