24 citations · 33 across the 12 of their papers we have counts for
4 papers · 1 filter
Heuristic Algorithms for Best Match Graph Editing
David Schaller, Manuela Geiß, Marc Hellmuth +1
Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics and can be approximated with the help of similarity measures between ge…
Hierarchical and Modularly-Minimal Vertex Colorings
Dulce I. Valdivia, Manuela Geiß, Maribel Hernández Rosales +2
Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of…
Hierarchical Colorings of Cographs
D. I. Valdivia, M. Geiß, M. Hellmuth +2
Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors $χ(…
Best Match Graphs
Manuela Geiß, Edgar Chavez, Marcos Gonzalez +6
THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let …