Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...