Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs

@article{Corneil1995LinearTA,
  title={Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs},
  author={Derek G. Corneil and Stephan Olariu and Lorna Stewart},
  journal={SIAM J. Comput.},
  year={1995},
  volume={28},
  pages={1284-1297}
}
An independent set of three vertices is called an asteroidal triple if between each pair in the triple there exists a path that avoids the neighborhood of the third. A graph is asteroidal triplefree (AT-free) if it contains no asteroidal triple. The motivation for this investigation is provided, in part, by the fact that AT-free graphs offer a common generalization of interval, permutation, trapezoid, and cocomparability graphs. Previously, the authors have given an existential proof of the… CONTINUE READING