×

Efficient algorithms for interval graphs and circular-arc graphs. (English) Zbl 0493.68066


MSC:

68R10 Graph theory (including graph drawing) in computer science
68Q25 Analysis of algorithms and problem complexity
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Booth, J. Comput. System Sci. 13 pp 335– (1976) · Zbl 0367.68034 · doi:10.1016/S0022-0000(76)80045-1
[2] and , On finding a maximum independent stable set of a graph. In Proc. of Fourth Annual Princeton Conference on Information Sciences and Systems. Princeton, NJ, 1970.
[3] Fredman, Commun. Assoc. Comput. Mach. 21 pp 540– (1978)
[4] and , Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979). · Zbl 0411.68039
[5] , , and , The complexity of coloring circular arcs and chords. Technical Report, Bell Telephone Laboratories, Murray Hills, NJ, 1979.
[6] Gavril, Networks 4 pp 357– (1974)
[7] Gupta, IEEE Trans. Computers C-28 pp 807– (1979)
[8] , and , Efficient algorithms for interval and circular-arc graphs. Technical Report #81-01-FC-01, Department of Electrical Engineering and Computer Science, Northwestern University, 1981.
[9] and , Wire routing by optimizing channel assignment within large apertures. In Proc. 8th Design Automation Workshop, 1971, pp. 155–169.
[10] Hopcroft, SIAMJ. Comput. 2 pp 225– (1973)
[11] , and , An optimum channel-routing algorithm for polycell layouts of integrated circuits. In Proc. 10th Design Automation Workshop, 1973, pp. 50–59.
[12] and , Geometric intersection problems. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Long Beach, CA, 1976, pp. 208–215.
[13] Tucker, SIAM J. on Comput. 9 pp 1– (1980)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.