Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769)
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: Using SPQR-trees to speed up algorithms based on 2-cutset decompositions |
scientific article; zbMATH DE number 6639888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using SPQR-trees to speed up algorithms based on 2-cutset decompositions |
scientific article; zbMATH DE number 6639888 |
Statements
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (English)
0 references
17 October 2016
0 references
graph decomposition
0 references
SPQR-tree
0 references
recognition algorithms
0 references
chordless graphs
0 references
propeller-subgraph-free graphs
0 references
0.9228708148002625
0 references
0.8228031396865845
0 references
