Finding short cycles in embedded graph in polynomial time (Q977665)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5724870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding short cycles in embedded graph in polynomial time |
scientific article; zbMATH DE number 5724870 |
Statements
Finding short cycles in embedded graph in polynomial time (English)
0 references
23 June 2010
0 references
\(\Pi\)-twosided cycle
0 references
breadth-first-search tree
0 references
embedded graph
0 references
0.92165315
0 references
0.92165315
0 references
0.91565293
0 references
0 references
0.91046727
0 references
0.90374136
0 references
0.9021632
0 references
0.8994568
0 references
0.8968941
0 references
