Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-2
|
Results: 2
Polynomial time Manhattan routing without doglegs - A generalization of Gallai's algorithm
Authors:
Boros, E Recski, A Szkaliczki, T Wettl, F
Citation:
E. Boros et al., Polynomial time Manhattan routing without doglegs - A generalization of Gallai's algorithm, COMPUT A IN, 18(4), 1999, pp. 403-413
Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete
Authors:
Szkaliczki, T
Citation:
T. Szkaliczki, Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete, SIAM J COMP, 29(1), 1999, pp. 274-287
Risultati:
1-2
|