Strongly chordal and chordal bipartite graphs are sandwich monotone
暂无分享,去创建一个
Pinar Heggernes | Charis Papadopoulos | Federico Mancini | R. Sritharan | P. Heggernes | Charis Papadopoulos | R. Sritharan | F. Mancini | Federico Mancini
[1] Flavia Bonomo,et al. NP-completeness results for edge modification problems , 2006, Discret. Appl. Math..
[2] Ioan Todinca,et al. Treewidth and Minimum Fill-in: Grouping the Minimal Separators , 2001, SIAM J. Comput..
[3] Haim Kaplan,et al. Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs , 1999, SIAM J. Comput..
[4] Roded Sharan,et al. Complexity classification of some edge modification problems , 1999, Discret. Appl. Math..
[5] Mihály Bakonyi,et al. Several results on chordal bipartite graphs , 1997 .
[6] Haim Kaplan,et al. Four Strikes Against Physical Mapping of DNA , 1995, J. Comput. Biol..
[7] Yoshio Okamoto,et al. On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints , 2008, COCOON.
[8] M. Yannakakis. Computing the Minimum Fill-in is NP^Complete , 1981 .
[9] P. Heggernes,et al. Characterizing minimal interval completions towards better understanding of profile and pathwidth , 2007 .
[10] Pinar Heggernes,et al. Minimal Split Completions of Graphs , 2006, LATIN.
[11] D. Rose. A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .
[12] Pinar Heggernes,et al. Characterizing Minimal Interval Completions , 2007, STACS.
[13] Jeremy P. Spinrad,et al. Doubly Lexical Ordering of Dense 0 - 1 Matrices , 1993, Inf. Process. Lett..
[14] Pinar Heggernes,et al. Minimal split completions , 2009, Discret. Appl. Math..
[15] Béla Bollobás,et al. Measures on monotone properties of graphs , 2002, Discret. Appl. Math..
[16] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[17] Arie M. C. A. Koster,et al. Safe separators for treewidth , 2006, Discret. Math..
[18] Pinar Heggernes,et al. Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions , 2007, Theor. Comput. Sci..
[19] D. Rose. Triangulated graphs and the elimination process , 1970 .
[20] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[21] Charis Papadopoulos,et al. Characterizing and computing minimal cograph completions , 2008, Discret. Appl. Math..
[22] Martin Farber,et al. Characterizations of strongly chordal graphs , 1983, Discret. Math..
[23] Celina M. H. de Figueiredo,et al. On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs , 2007, Theor. Comput. Sci..
[24] Ton Kloks,et al. A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs , 2000, Discret. Appl. Math..
[25] R. Sritharan. Chordal bipartite completion of colored graphs , 2008, Discret. Math..
[26] David Buhagiar,et al. On uniform paracompactness , 1996 .
[27] Fedor V. Fomin,et al. Exact algorithms for treewidth and minimum fill-in ∗ † , 2006 .
[28] M. Golumbic. Chapter 3 - Perfect graphs , 2004 .
[29] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..
[30] Noga Alon,et al. Every monotone graph property is testable , 2005, STOC '05.
[31] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .