scientific article
From MaRDI portal
Publication:3005918
zbMath1214.05161MaRDI QIDQ3005918
Publication date: 10 June 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
extreme pointcombinatorial optimizationpolytopespanning treefacetoperations researchseries parallel graphscomputer mathematics\(K\)th best spanning tree
Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) ⋮ The Kth TSP is pseudopolynomial when TSP is polynomial ⋮ A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
Uses Software
This page was built for publication:
