Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.07.029 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Graph decomposition,SPQR-tree,recognition algorithms,chordless graphs,propeller-subgraph-free graphs | Block graph,Discrete mathematics,Outerplanar graph,Combinatorics,Line graph,Tree decomposition,Algorithm,Implicit graph,SPQR tree,Pathwidth,Voltage graph,Mathematics | Journal |
Volume | ISSN | Citations |
50 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| C.M.H. de Figueiredo | 1 | 21 | 2.72 |
| Hélio B. Macêdo Filho | 2 | 0 | 0.34 |
| Zhanqing Li | 3 | 35 | 13.98 |
| Raphael C. S. Machado | 4 | 48 | 17.29 |
| Nicolas Trotignon | 5 | 194 | 27.96 |