Space-efficient biconnected components and recognition of outerplanar graphs (Q4608619)
From MaRDI portal
!
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 6851889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space-efficient biconnected components and recognition of outerplanar graphs |
scientific article; zbMATH DE number 6851889 |
Statements
21 March 2018
0 references
graph algorithms
0 references
space efficiency
0 references
cut vertices
0 references
maximal outerplanar graphs
0 references
0.999048352241516
0 references
0.8089361190795898
0 references
0.8054060935974121
0 references
0.7855322957038879
0 references
0.7714654207229614
0 references
