Deciding whether graph \(G\) has page number one is in NC (Q1195855)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding whether graph \(G\) has page number one is in NC |
scientific article; zbMATH DE number 86083
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding whether graph \(G\) has page number one is in NC |
scientific article; zbMATH DE number 86083 |
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
