@techreport{TR-DCC-93-04,
  number = {DCC-93-04},
  author = {de Figueiredo, Celina M. H. and Meidanis, João and de Mello, Célia P.},
  title = {A {lexBFS} Algorithm for Proper Interval Graph Recognition},
  month = {March},
  year = {1993}, 
  institution = {Department of Computer Science, University of Campinas},
  note = {In English, 16 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      Interval graphs are the intersection graphs of families of
      intervals in the real line.  If the intervals can be chosen so
      that no interval contains another, we obtain the subclass of
      proper interval graphs.  In this paper, we show how to recognize
      proper interval graphs with one lexBFS.  This algorithm runs
      in linear time, and produces as a by-product the clique partition
      of the input graph.
  }
}