Efficient polynomial-time algorithms for special graph partitioning problems
zbMATH Open1297.05003MaRDI QIDQ2877347
Publication date: 22 August 2014
Ising spin glassesmaximum weight matching problem on planar graphspolynomial-time solvable optimization problems
Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: Efficient polynomial-time algorithms for special graph partitioning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2877347)
