Minimum Cuts for Circular-Arc Graphs
- 1 December 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (6) , 1041-1050
- https://doi.org/10.1137/0219071
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Topological via minimization revisitedIEEE Transactions on Computers, 1991
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc GraphSIAM Journal on Computing, 1988
- Geometric complexity of some location problemsAlgorithmica, 1986
- Competitive location strategies for two facilitiesRegional Science and Urban Economics, 1982