A fully dynamic algorithm for recognizing and representing proper interval graphs

SIAM Journal on Computing

Volumn 31, Issue 1, 2001, Pages 289-305

  Hell, Pavol ^a   Shamir, Ron ^b   Sharan, Roded ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Fully dynamic algorithms; Graph algorithms; Lower bounds; Proper interval graphs

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0036215514     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700372216     Document Type: Article

References (21)

1. A. V. CARRANO, Establishing the order of human chromosome-specific DNA fragments, in Biotechnology and the Human Genome, A. D. Woodhead and B. J. Barnhart, eds., Plenum Press, New York, 1988, pp. 37-50.
2. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
3. D. CORNEIL, H. KIM, S. NATARAJAN, S. OLARIU, AND A. P. SPRAGUE, Simple linear time recognition of unit interval graphs, Inform. Process. Lett., 55 (1995), pp. 99-104.
4. X. DENG, P. HELL, AND J. HUANG, Recognition and representation of proper circular arc graphs, in Proceedings of the 2nd Integer Programming and Combinatorial Optimization (IPCO), Carnegie Mellon University, Pittsburgh, PA, 1992, pp. 114-121.
5. Journal version: Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs, SIAM J. Comput., 25 (1996), pp. 390-403.
6. D. EPPSTEIN, Z. GALIL, G. F. ITALIANO, AND A. NISSENZWEIG, Sparsification - A technique for speeding up dynamic graph algorithms, in Proceedings of the 33rd Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1992, pp. 60-69.
7. M. FREDMAN AND M. SAKS, The cell probe complexity of dynamic data structures, in Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, ACM, New York, 1989, pp. 345-354.
8. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
9. P. HELL, R. SHAMIR, AND R. SHARAN, A fully dynamic algorithm for recognizing and representing proper interval graphs, in Proceedings of the Seventh Annual European Symposium on Algorithms (ESA '99), Lecture Notes in Comput. Sci. 1643, Springer-Verlag, New York, 1999, pp. 527-539.
10. M. HENZINGER AND M. FREDMAN, Lower bounds for fully dynamic connectivity problems in graphs, Algorithmica, 22 (1998), pp. 351-362.
11. J. HOLM, K. DE LICHTENBERG, AND M. THORUP, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), New York, 1998, ACM Press, New York, pp. 79-89.
12. W.-L. HSU, A simple test for interval graphs, in Proceedings of the 18th International Workshop (WG '92), Wiesbaden-Naurod, Germany, Graph-Theoretic Concepts in Computer Science, W.-L. Hsu and R. C. T. Lee, eds., Springer-Verlag, Berlin, 1992, pp. 11-16.
13. L. IBARRA, Fully dynamic algorithms for chordal graphs, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), SIAM, Philadelphia, 1999, pp. 923-924.
14. C. G. LEKKERKERKER AND J. C. BOLAND, Representation of a finite graph by a set of intervals on the real line, Fund. Math., 51 (1962), pp. 45-64.
15. P. LODGES AND S. OLARIU, Optimal greedy algorithms for indifference graphs, Comput. Math. Appl., 25 (1993), pp. 15-25.
16. P. B. MILTERSEN, S. SUBRAMANIAN, J. S. VITTER, AND R. TAMASSIA, Complexity models for incremental computation, Theoret. Comput. Sci., 130 (1994), pp. 203-236.
17. F. S. ROBERTS, Indifference graphs, in Proof Techniques in Graph Theory, F. Harary, ed., Academic Press, New York, 1969, pp. 139-146.
18. M. THORUP, Near-optimal fully-dynamic graph connectivity, in Proceedings of the 32th Annual ACM Symposium on Theory of Computing (STOC'00), 2000, pp. 343-350.
19. J. WATSON, M. GILMAN, J. WITKOWSKI, AND M. ZOLLER, Recombinant DNA, 2nd ed., W. H. Freeman, New York, 1992.
20. n, Ph.D. thesis, University of Göttingen, Göttingen, Germany, 1967.
21. A. YAO, Should tables be sorted?, J. ACM, 28 (1981), pp. 615-628.