5 citations · 5 across the 2 of their papers we have counts for
2 papers
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.DM2014
Spiders can be recognized by counting their legs
Sarah Berkemer, Ricardo Chaves, Adrian Fritz +3
Spiders are arthropods that can be distinguished from their closest relatives, the insects, by counting their legs. Spiders have 8, insects just 6. Spider graphs are a very restric…