Period
2008 - 2008
Number
1
Co-Authors
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout? (2008)
Piotr Berman, Andrewb. Kahng, Devendra Vidhani
Abstract. Given a graph G with weighted edges, and a subset of nodes T,theT-join problem asks for a minimum weight edgesetA such thata node u is incident to an odd number of edges of A i u 2 T.We...