Min-Cut Methods for Mapping Dataflow Graphs

Volker Elling, Karsten Schwan. Min-Cut Methods for Mapping Dataflow Graphs. In Patrick Amestoy, Philippe Berger, Michel J. Daydé, Iain S. Duff, Valérie Frayssé, Luc Giraud, Daniel Ruiz, editors, Euro-Par 99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31 - September 3, 1999, Proceedings. Volume 1685 of Lecture Notes in Computer Science, pages 203-212, Springer, 1999. [doi]

@inproceedings{EllingS99,
  title = {Min-Cut Methods for Mapping Dataflow Graphs},
  author = {Volker Elling and Karsten Schwan},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1685/16850203.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/EllingS99},
  cites = {0},
  citedby = {0},
  pages = {203-212},
  booktitle = {Euro-Par  99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31 - September 3, 1999, Proceedings},
  editor = {Patrick Amestoy and Philippe Berger and Michel J. Daydé and Iain S. Duff and Valérie Frayssé and Luc Giraud and Daniel Ruiz},
  volume = {1685},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66443-2},
}