"Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth."

Tobias Friedrich et al. (2023)

> Home

Details and statistics

DOI: 10.1145/3564246.3585150

access: closed

type: Conference or Workshop Paper

metadata version: 2023-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/0001I0MZ23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/0001I0MZ23
Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC 2023: 1325-1334

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.