A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract)

Shin-Ichi Nakano, Makiko Yoshikawa. A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). In Joe Marks, editor, Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings. Volume 1984 of Lecture Notes in Computer Science, pages 296-307, Springer, 2000. [doi]

@inproceedings{NakanoY00,
  title = {A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract)},
  author = {Shin-Ichi Nakano and Makiko Yoshikawa},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1984/19840296.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/NakanoY00},
  cites = {0},
  citedby = {0},
  pages = {296-307},
  booktitle = {Graph Drawing,  8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings},
  editor = {Joe Marks},
  volume = {1984},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41554-8},
}