A P-complete graph partition problem (Q917313): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4128417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum flow problem is log space complete for P / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-first search is inherently sequential / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:01, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A P-complete graph partition problem |
scientific article |
Statements
A P-complete graph partition problem (English)
0 references
1990
0 references
graph partition problem
0 references
computational complexity
0 references
P-complete problems
0 references
lexicographical first different than majority labelling
0 references
