Euler paths in series parallel graphs

@inproceedings{Kosaraju2001EulerPI,
  title={Euler paths in series parallel graphs},
  author={S. Rao Kosaraju},
  booktitle={STOC},
  year={2001}
}
Given a series-parallel graph, we consider the problem of drawing its layout in the plane (and the planar dual of the layout) such that the euler count of the layout is minimized. This problem is of considerable importance to the design of CMOS circuits. Even though it was believed that there cannot exist a polynomial time algorithm for this problem, we… CONTINUE READING