论文信息 - Using SPQR-trees to speed up algorithms based on 2-cutset decompositions - 字舞流文

Using SPQR-trees to speed up algorithms based on 2-cutset decompositions

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.

Celina M. H. de Figueiredo | Z. Li | Hélio B. Macêdo Filho | Raphael Machado | Nicolas Trotignon

[1] Nicolas Trotignon,et al. On Roussel-Rubio-type lemmas and their consequences , 2011, Discret. Math..

[2] M. Plummer. On minimal blocks , 1968 .

[3] Nicolas Trotignon,et al. On graphs with no induced subdivision of K4 , 2012, J. Comb. Theory, Ser. B.

[4] Ladislav Nebeský. On induced subgraphs of a block , 1977, J. Graph Theory.

[5] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[6] TamassiaRoberto,et al. On-Line Planarity Testing , 1996 .

[7] G. Dirac,et al. Minimally 2-connected graphs. , 1967 .

[8] Nicolas Trotignon,et al. Graphs that do not contain a cycle with a node that has at least two neighbors on it , 2013, SIAM J. Discret. Math..

[9] Roberto Tamassia,et al. On-Line Planarity Testing , 1989, SIAM J. Comput..

[10] Nicolas Trotignon,et al. A structure theorem for graphs with no cycle with a unique chord and its consequences , 2010 .