An Efficient Test for Circular-Arc Graphs
- 1 February 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (1) , 1-24
- https://doi.org/10.1137/0209001
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Characterization problems for graphs, partially ordered sets, lattices, and families of setsDiscrete Mathematics, 1976
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURESBritish Journal of Mathematical and Statistical Psychology, 1974
- Algorithms on circular‐arc graphsNetworks, 1974
- Scheduling of traffic lights—A new approachTransportation Research, 1968
- Circular genetic mapsJournal of Cellular Physiology, 1967
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962
- ON THE TOPOLOGY OF THE GENETIC FINE STRUCTUREProceedings of the National Academy of Sciences, 1959