On the distributed decision-making complexity of the minimum vertex cover problem (Q3126012): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1706504674 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the value of information in distributed decision-making (extended abstract) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear programming without the matrix / rank | |||
Normal rank |
Latest revision as of 11:56, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the distributed decision-making complexity of the minimum vertex cover problem |
scientific article |
Statements
On the distributed decision-making complexity of the minimum vertex cover problem (English)
0 references
4 December 1997
0 references
vertex covers
0 references
distributed decision-making model
0 references