A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmics for hard problems. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4368728 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-Theoretic Concepts in Computer Science / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation and Online Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the complexity of minimum dominating set / rank | |||
Normal rank | |||
Latest revision as of 04:00, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized algorithm for determining dominating sets in graphs of maximum degree five |
scientific article |
Statements
A randomized algorithm for determining dominating sets in graphs of maximum degree five (English)
0 references
6 November 2009
0 references
minimum dominating set
0 references
Las Vegas technique
0 references
randomized algorithm
0 references
polynomial-time approximation algorithm
0 references
