๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Solving minimum K-cardinality cut problems in planar graphs

โœ Scribed by Maurizio Bruglieri; Francesco Maffioli; Marco Trubian


Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
291 KB
Volume
48
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A branch-and-cut algorithm for solving g
โœ Suhl, Uwe H.; Hilbert, Heinrich ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 163 KB ๐Ÿ‘ 2 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p