Max cut of a sparse graph with maximum degree of 2.

by rajeesh   Last Updated September 11, 2019 18:20 PM - source

What is the time and space complexity of the best algorithm to find Max cut of a sparse graph with maximum degree of 2.

Tags : graph-theory


Related Questions


Eigenvalue of the Laplacian of a tree

Updated August 12, 2018 18:20 PM

Disconnected subgraph pair of $k$ regular graph.

Updated July 18, 2015 13:08 PM

Bounded generated function

Updated May 26, 2019 17:20 PM

How to represent tripartite graphs as matrices?

Updated April 18, 2018 10:20 AM