Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
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
Yao Qi, Raja Das, et al.
ISSTA 2009
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005