112 citations · 135 across the 11 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DM2015★ 5 cited
Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s
Marc Hellmuth, Adrian Fritz, Nicolas Wieseke +1
Cographs are graphs in which no four vertices induce a simple connected path . Cograph editing is to find for a given graph a set of at most edge additions and…
cs.DM2015
On Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions
Marc Hellmuth, Nicolas Wieseke
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\ in phylogenomics. In this context symbo…
cs.DM2015★ 10 cited
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
Marc Hellmuth, Nicolas Wieseke
Symbolic ultrametrics define edge-colored complete graphs K_n and yield a simple tree representation of K_n. We discuss, under which conditions this idea can be generalized to find…