Chordal probe graphs
暂无分享,去创建一个
[1] Jeremy P. Spinrad,et al. Construction of probe interval models , 2002, SODA '02.
[2] Martin Charles Golumbic,et al. Chordal probe graphs , 2003, Discret. Appl. Math..
[3] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.
[4] Peisen Zhang,et al. An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA , 1994, Comput. Appl. Biosci..
[5] Jeremy P. Spinrad,et al. Weakly chordal graph algorithms via handles , 2000, SODA '00.
[6] X. Ye,et al. Integrated mapping package--a physical mapping software tool kit. , 1999, Genomics.
[7] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[8] Pinar Heggernes,et al. Recognizing Weakly Triangulated Graphs by Edge Separability , 2000, Nord. J. Comput..
[9] Jeremy P. Spinrad,et al. A polynomial time recognition algorithm for probe interval graphs , 2001, SODA '01.
[10] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .
[11] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[12] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[13] Fred R. McMorris,et al. On Probe Interval Graphs , 1998, Discret. Appl. Math..
[14] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .