scientific article; zbMATH DE number 7053388
From MaRDI portal
Publication:5743512
zbMath1421.68067MaRDI QIDQ5743512
Dániel Marx, Rajesh Chitnis, Mohammad Taghi Hajiaghayi
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095252
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (2)
Adapting the directed grid theorem into an \textsf{FPT} algorithm ⋮ Improved parameterized and exact algorithms for cut problems on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- FPT algorithms for path-transversal and cycle-transversal problems
- Parameterized graph separation problems
- Simple and improved parameterized algorithms for multiterminal cuts
- Almost 2-SAT is fixed-parameter tractable
- An improved parameterized algorithm for the minimum node multiway cut problem
- Parametrized complexity theory.
- A 2-Approximation Algorithm for the Directed Multiway Cut Problem
- Rounding algorithms for a geometric embedding of minimum multiway cut
- Clustering with Local Restrictions
- Maximal Flow Through a Network
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Multiway cuts in directed and node weighted graphs
- Multicut is FPT
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
This page was built for publication:
