Author： Kant G. Bodlaender H.L.
Publisher： Academic Press
ISSN： 0890-5401
Source： Information and Computation, Vol.135, Iss.1, 1997-05, pp. : 1-14
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Maximum Directed Cuts in Graphs with Degree Constraints
By Xu Baogang
Graphs and Combinatorics, Vol. 28, Iss. 4, 2012-07 ,pp. :
Access to resources
Recommend
Sparse
By Hajiabolhassan Hossein Zhu Xuding
Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. :
Rectangular drawings of planar graphs
By Rahman M.S. Nishizeki T. Ghosh S.
Journal of Algorithms, Vol. 50, Iss. 1, 2004-01 ,pp. :
By Li Yinkui
International Journal of Computer Mathematics, Vol. 82, Iss. 7, 2005-07 ,pp. :