2 citations · 18 across the 23 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
Extending Partial Representations of Circular-Arc Graphs
Jiří Fiala, Ignaz Rutter, Peter Stumpf +1
The partial representation extension problem generalizes the recognition problem for classes of graphs defined in terms of vertex representations. We exhibit circular-arc graphs as…
cs.DS2021
Experimental Comparison of PC-Trees and PQ-Trees
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
PQ-trees and PC-trees are data structures that represent sets of linear and circular orders, respectively, subject to constraints that specific subsets of elements have to be conse…