2 citations · 4 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Canonical Representations for Circular-Arc Graphs Using Flip Sets
Maurice Chandoo
We show that computing canonical representations for circular-arc (CA) graphs reduces to computing certain subsets of vertices called flip sets. For a broad class of CA graphs, whi…
cs.DS2015★ 1 cited
Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace
Maurice Chandoo
We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish t…