Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850)
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: Complexity and algorithms for recognizing polar and monopolar graphs |
scientific article; zbMATH DE number 6269724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and algorithms for recognizing polar and monopolar graphs |
scientific article; zbMATH DE number 6269724 |
Statements
Complexity and algorithms for recognizing polar and monopolar graphs (English)
0 references
13 March 2014
0 references
polar graph
0 references
monopolar graph
0 references
planar graph
0 references
computational complexity
0 references
0 references
0.9408100843429564
0 references
0.9076091647148132
0 references
0.8493297100067139
0 references
0.8476874232292175
0 references
