Interval graphs and related topics
- 31 July 1985
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 55 (2), 113-121
- https://doi.org/10.1016/0012-365x(85)90039-1
Abstract
No abstract availableThis publication has 52 references indexed in Scilit:
- An O(qn) algorithm to q-color a proper family of circular arcsDiscrete Mathematics, 1985
- Irrepresentability by multiple intersection, or why the interval number is unboundedDiscrete Mathematics, 1985
- On the chromatic number of multiple interval graphs and overlap graphsDiscrete Mathematics, 1985
- Optimal algorithms to compute the closure of a set of iso-rectanglesJournal of Algorithms, 1984
- An improved algorithm for the rectangle enclosure problemJournal of Algorithms, 1982
- Rectilinear line segment intersection, layered segment trees, and dynamizationJournal of Algorithms, 1982
- Finding intersection of rectangles by range searchJournal of Algorithms, 1981
- The measure problem for rectangular ranges in d-spaceJournal of Algorithms, 1981
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- Finding the contour of a union of iso-oriented rectangiesJournal of Algorithms, 1980