@inproceedings{Kosaraju2001EulerPI, title={Euler paths in series parallel graphs}, author={S. Rao Kosaraju}, booktitle={STOC}, year={2001} }

- Published 2001 in STOC
DOI:10.1145/380752.380806

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

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=380806.

### Presentations referencing similar topics