Title of article
Maximum cut on line and total graphs Original Research Article
Author/Authors
Venkatesan Guruswami، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
5
From page
217
To page
221
Abstract
The maximum cut problem is proved to be polynomial time solvable on line graphs, while it is proved to be NP-hard on the related class of total graphs.
Journal title
Discrete Applied Mathematics
Serial Year
1999
Journal title
Discrete Applied Mathematics
Record number
884892
Link To Document