Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph G and a demand graph H on a set $$T\subseteq V(G)$$ T ⊆ V ( G ) of terminals, the task is to find a minimum-weight set C of edges of G such that whenever two vertices of T are adjacent in H , th...
Saved in:
| Published in: | Discrete & computational geometry |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
22.10.2025
|
| ISSN: | 0179-5376, 1432-0444 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!