The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069)
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: The maximal f-dependent set problem for planar graphs is in NC |
scientific article; zbMATH DE number 985359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximal \(f\)-dependent set problem for planar graphs is in NC |
scientific article; zbMATH DE number 985359 |
Statements
The maximal \(f\)-dependent set problem for planar graphs is in NC (English)
0 references
28 February 1997
0 references
maximal \(f\)-dependent set
0 references
0 references
0.99530566
0 references
0.90472424
0 references
0.90432113
0 references
0.8832256
0 references
0.87822276
0 references
0.8724437
0 references
0.8702767
0 references
0.8672682
0 references
0.86667556
0 references
