Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488)
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 recognition algorithms based on 2-cutsets |
scientific article; zbMATH DE number 6872413
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using SPQR-trees to speed up recognition algorithms based on 2-cutsets |
scientific article; zbMATH DE number 6872413 |
Statements
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (English)
0 references
24 May 2018
0 references
recognition algorithms
0 references
linear-time complexity
0 references
SPQR-trees
0 references
chordless graphs
0 references
propeller-free graphs
0 references
