Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles
From MaRDI portal
Publication:2904512
DOI10.1007/978-3-642-31265-6_31zbMath1358.05282OpenAlexW122705633MaRDI QIDQ2904512
Jesper Jansson, Andrzej Lingas
Publication date: 14 August 2012
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_31
Problems related to evolution (92D15) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
This page was built for publication: Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles
