Acyclic networks maximizing the printing complexity

Franck Guingne, Florent Nicart, André Kempe. Acyclic networks maximizing the printing complexity. Theoretical Computer Science, 328(1-2):39-51, 2004. [doi]

@article{GuingneNK04,
  title = {Acyclic networks maximizing the printing complexity},
  author = {Franck Guingne and Florent Nicart and André Kempe},
  year = {2004},
  doi = {10.1016/j.tcs.2004.07.006},
  url = {http://dx.doi.org/10.1016/j.tcs.2004.07.006},
  researchr = {https://researchr.org/publication/GuingneNK04},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {328},
  number = {1-2},
  pages = {39-51},
}