论文信息 - Graphs with polynomially many minimal separators - 字舞流文

Graphs with polynomially many minimal separators

M. Chudnovsky | Tara Abrishami | St'ephan Thomass'e | Nicolas Trotignon | Cemil Dibek | Kristina Vuvskovi'c

[1] Anne Berry,et al. Generating All the Minimal Separators of a Graph , 1999, Int. J. Found. Comput. Sci..

[2] Ioan Todinca,et al. Treewidth and Minimum Fill-in: Grouping the Minimal Separators , 2001, SIAM J. Comput..

[3] Ioan Todinca,et al. Listing all potential maximal cliques of a graph , 2000, Theor. Comput. Sci..

[4] Fedor V. Fomin,et al. Finding Induced Subgraphs via Minimal Triangulations , 2009, STACS.

[5] Anne Berry,et al. An Introduction to Clique Minimal Separator Decomposition , 2010, Algorithms.

[6] Independent set in P5-free graphs in polynomial time , 2014, SODA 2014.

[7] Daniel Lokshtanov,et al. Independent Set in P5-Free Graphs in Polynomial Time , 2014, SODA.

[8] Bert Gerards,et al. Stable sets and graphs with no even holes , 2013, Math. Program..

[9] H. Müller,et al. On rank-width of even-hole-free graphs , 2016, Discret. Math. Theor. Comput. Sci..

[10] Maria Chudnovsky,et al. Maximum independent sets in (pyramid, even hole)-free graphs , 2019, ArXiv.

[11] Michal Pilipczuk,et al. Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs , 2019, SODA.

[12] Paul D. Seymour,et al. Induced subgraphs of bounded treewidth and the container method , 2020, SODA.

[13] Michal Pilipczuk,et al. Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs , 2017, SODA.