Partitioning planar graphs: a fast combinatorial approach for max-cut
Year of publication: |
2012
|
---|---|
Authors: | Liers, F. ; Pardella, G. |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 51.2012, 1, p. 323-344
|
Publisher: |
Springer |
Subject: | Maximum cut | Planar graph | Perfect matching | Kasteleyn city | T-join |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Improving on best-of-many-christofides for T-tours
Traub, Vera, (2020)
-
Canonical dual approach to solving the maximum cut problem
Wang, Zhenbo, (2012)
-
The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications
Punnen, Abraham P., (2022)
- More ...