Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Data Structures: 6th International Workshop, WADS' 99 Vancouver, Canada, August 11-14, 1999 Proceedings > The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
Algorithms and Data Structures: 6th International Workshop, WADS' 99 Vancouver, Canada, August 11-14, 1999 Proceedings |
Frank Dehne; Jörg-Rüdiger Sack; Arvind Gupta; Roberto Tamassia
Springer Berlin Heidelberg
Algorithms and Data Structures: 6th International Workshop, WADS' 99 Vancouver, Canada, August 11-14, 1999 Proceedings
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
Authors

Piotr Berman; Andrew B. Kahng; Devendra Vidhani; Alexander Zelikovsky

ARI Id

1674219648223_1743785

Access

Not Available Free

Pages

25-36

DOI

10.1007/3-540-48447-7_3

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-48447-7_3

Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings