Deciding whether graph \(G\) has page number one is in NC (Q1195855): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90247-s / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023008617 / rank | |||
Normal rank | |||
Latest revision as of 12:06, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding whether graph \(G\) has page number one is in NC |
scientific article |
Statements
Deciding whether graph \(G\) has page number one is in NC (English)
0 references
4 January 1993
0 references
class NC
0 references
parallel graph algorithm
0 references
forbidden subgraph
0 references
polylog time algorithm
0 references
page number one
0 references
