Parallel algorithms on circular-arc graphs
- 10 February 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (6) , 275-281
- https://doi.org/10.1016/0020-0190(90)90209-g
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Some parallel algorithms on interval graphsDiscrete Applied Mathematics, 1987
- Total domination in interval graphsInformation Processing Letters, 1986
- An introduction to parallelism in combinatorial optimizationDiscrete Applied Mathematics, 1986
- An improved parallel algorithm for maximal matchingInformation Processing Letters, 1986
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle GraphsSIAM Journal on Computing, 1985
- Binary Trees and Parallel Scheduling AlgorithmsIEEE Transactions on Computers, 1983
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- Parallel Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- Algorithms on circular‐arc graphsNetworks, 1974