scientific article; zbMATH DE number 7559431
From MaRDI portal
Publication:5089231
DOI10.4230/LIPIcs.MFCS.2020.60MaRDI QIDQ5089231
Kazuhiro Kurita, Yasuaki Kobayashi
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2006.16222
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- FPT algorithms for path-transversal and cycle-transversal problems
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Parameterized graph separation problems
- Generating cut conjunctions in graphs and related problems
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Simple and improved parameterized algorithms for multiterminal cuts
- On generating all maximal independent sets
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- On enumerating all minimal solutions of feedback problems
- Efficient enumeration of all minimal separators in a graph
- An improved approximation algorithm of MULTIWAY CUT.
- Algorithmic graph theory and perfect graphs
- Efficient algorithms for \(k\)-terminal cuts on planar graphs
- A paradigm for listing \((s,t)\)-cuts in graphs
- Reverse search for enumeration
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators
- Rounding algorithms for a geometric embedding of minimum multiway cut
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
- A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
- On Multiway Cut Parameterized above Lower Bounds
- Large Induced Subgraphs via Triangulations and CMSO
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- The Complexity of Multiterminal Cuts
- Listing all Minimal Separators of a Graph
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
This page was built for publication:
