Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Paper
State Splitting for Variable-Length Graphs
Abstract
The state splitting algorithm of Adler, Coppersmith, and Hassner for graphs with edges of fixed length is extended to graphs with edges of variable lengths. This has the potential to improve modulation code construction techniques. Although the ideas of state splitting come from dynamical systems, completely graph-theoretic terms are used. © 1986 IEEE
Related
Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science