4 citations · 9 across the 4 of their papers we have counts for
1 paper · 1 filter
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the…