Title of article :
Maximum cut on line and total graphs Original Research Article
Author/Authors :
Venkatesan Guruswami، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
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
Journal title :
Discrete Applied Mathematics
