Unit Circular-Arc Graph Representations and Feasible Circulations

@article{Lin2008UnitCG,
  title={Unit Circular-Arc Graph Representations and Feasible Circulations},
  author={Min Chih Lin and Jayme Luiz Szwarcfiter},
  journal={SIAM J. Discrete Math.},
  year={2008},
  volume={22},
  pages={409-423}
}
In a recent paper, Durán, Gravano, McConnell, Spinrad and Tucker described an algorithm of complexity O(n2) for recognizing whether a graph G with n vertices and m edges is a unit circular-arc (UCA) graph. Furthermore the following open questions were posed in the above paper: (i) Is it possible to construct a UCA model for G in polynomial time?; (ii) Is it possible to construct a UCA model, whose extremes of the arcs correspond to integers of polynomial size?; (iii) If (ii) is true, could such… CONTINUE READING