scientific article; zbMATH DE number 1875431
From MaRDI portal
Publication:4796190
zbMath1006.68546MaRDI QIDQ4796190
Publication date: 2 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610391
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
An overview of graph covering and partitioning ⋮ ILP-Based Local Search for Graph Partitioning ⋮ An exact algorithm for graph partitioning ⋮ Unnamed Item ⋮ The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ An exact combinatorial algorithm for minimum graph bisection ⋮ Unnamed Item
Uses Software
This page was built for publication:
