 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen  [1]
|
Hilfe 
|
 |
|
| Suche: Citkey="Lengauer/82a" |
|
Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees
Thomas Lengauer
SIAM Journal on Algebraic Discrete Methods 3 (1), 1982, March, pp. 99-113
| Publisher: | Society for Industrial and Applied Mathematics | |
| Address: | Philadelphia, PA | |
| Institution: | Bell Labs., Murray Hill, NJ, USA | |
| Keywords: | bounds, complexity, min-cut linear arrangement problem, trees, one-dimensional layout problems, undirected graphs, VSLI design, polynomial time algorithm | |
|
|
|
|