scientific article
From MaRDI portal
Publication:3346242
zbMath0552.94028MaRDI QIDQ3346242
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, Conjugate conflict continuation graphs for multi-layer constrained via minimization, A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem, A multiple search operator heuristic for the max-k-cut problem, An algorithm for min-cost edge-disjoint cycles and its applications, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems, Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs, A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
