| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651646 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
Abstract
We propose the use of SPQR-trees as a data structure to encode the 3-connected components of a graph and to obtain linear-time recognition algorithms for graph classes structurally characterized by 2-cutset decompositions.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
