"Computing finest mincut partitions of a graph and application to routing ..."

Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger (2008)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2007.03.022

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/ReineltTW08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/ReineltTW08
Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger:
Computing finest mincut partitions of a graph and application to routing problems. Discret. Appl. Math. 156(3): 385-396 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.