Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
From MaRDI portal
Publication:1183585
DOI10.1016/0304-3975(91)90265-4zbMath0752.68046MaRDI QIDQ1183585
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90265-4
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposing a set of points into chains, with applications to permutation and circle graphs
- On domination problems for permutation and other graphs
- An efficient parallel algorithm for updating minimum spanning trees
- An efficient algorithm for maxdominance, with applications
- Searching, Merging, and Sorting in Parallel Computation
- An Efficient Parallel Biconnectivity Algorithm
- Parallel Merge Sort
- Parallel Prefix Computation