Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

Maw-Shang Chang. Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs. In Jan van Leeuwen, editor, Algorithms, Software, Architecture - Information Processing 92, Volume 1, Proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992. Volume A-12 of IFIP Transactions, pages 402-408, North-Holland, 1992.

@inproceedings{Chang92:2,
  title = {Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs},
  author = {Maw-Shang Chang},
  year = {1992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Chang92%3A2},
  cites = {0},
  citedby = {0},
  pages = {402-408},
  booktitle = {Algorithms, Software, Architecture - Information Processing  92, Volume 1, Proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992},
  editor = {Jan van Leeuwen},
  volume = {A-12},
  series = {IFIP Transactions},
  publisher = {North-Holland},
  isbn = {0-444-89747-X},
}