On parallelizing a greedy heuristic for finding small dominant sets

DOI10.1007/BF01990343zbMath0771.68093OpenAlexW2003337973MaRDI QIDQ2366651

Iain A. Stewart

Publication date: 30 August 1993

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01990343

zbMATH Keywords

dominating setsgreedy heuristic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Ordered vertex removal and subgraph problems
• Depth-first search is inherently sequential
• Parallelism and the maximal path problem
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Approximation algorithms for combinatorial problems
• A taxonomy of problems with fast parallel algorithms
• A Greedy Heuristic for the Set-Covering Problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems

This page was built for publication: On parallelizing a greedy heuristic for finding small dominant sets