The following pages link to (Q3840353):
Displaying 6 items.
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width (Q2741506) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- Performing Multicut on Walkable Environments (Q2958325) (← links)
