Pages that link to "Item:Q2462149"

The following pages link to Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149):

Displaying 14 items.

• Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
• Restricted vertex multicut on permutation graphs (Q444445) (← links)
• On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
• Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
• Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
• Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
• How to Cut a Graph into Many Pieces (Q3010400) (← links)
• (Q5089231) (← links)
• Quick separation in chordal and split graphs (Q5089243) (← links)
• Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)