Spiders can be Recognized by Counting Their Legs
暂无分享,去创建一个
Peter F. Stadler | Marc Hellmuth | Adrian Fritz | Ricardo Régis Cavalcante Chaves | Maribel Hernandez-Rosales | Sarah Berkemer
[1] Katharina T. Huber,et al. Orthology relations, symbolic ultrametrics, and cographs , 2013, Journal of mathematical biology.
[2] Yong Gao,et al. Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes , 2012, Discret. Math. Algorithms Appl..
[3] Yunlong Liu,et al. Cograph Editing: Complexity and Parameterized Algorithms , 2011, COCOON.
[4] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .
[5] Stephan Olariu,et al. Recognizing P_4 Sparse Graphs in Linear Time , 1992, SIAM J. Comput..
[6] Katharina T. Huber,et al. From event-labeled gene trees to species trees , 2012, BMC Bioinformatics.
[7] Martin Middendorf,et al. Phylogenomics with paralogs , 2015, Proceedings of the National Academy of Sciences.
[8] Yunlong Liu,et al. Complexity and parameterized algorithms for Cograph Editing , 2012, Theor. Comput. Sci..
[9] S. E. Markosyan,et al. ω-Perfect graphs , 1990 .
[10] S. Olariu,et al. P4‐Reducible Graphs—Class of Uniquely Tree‐Representable Graphs , 1989 .