Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
- 9 December 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 91 (1) , 1-21
- https://doi.org/10.1016/0304-3975(91)90265-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Parallel Merge SortSIAM Journal on Computing, 1988
- An efficient parallel algorithm for updating minimum spanning treesTheoretical Computer Science, 1988
- On domination problems for permutation and other graphsTheoretical Computer Science, 1987
- Decomposing a set of points into chains, with applications to permutation and circle graphsInformation Processing Letters, 1985
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Parallel Prefix ComputationJournal of the ACM, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980