Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2017.01.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2017.01.009 / rank | |||
Normal rank | |||
Latest revision as of 08:17, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using SPQR-trees to speed up recognition algorithms based on 2-cutsets |
scientific article |
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
