Login / Signup
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs.
Arman Boyaci
Tínaz Ekim
Mordechai Shalom
Published in:
CoRR (2015)
Keyphrases
</>
maximum cardinality
bipartite graph
minimum weight
endpoints
planar graphs
evolutionary algorithm
graph structure