scientific article; zbMATH DE number 7559431
From MaRDI portal
Publication:5089231
DOI10.4230/LIPICS.MFCS.2020.60MaRDI QIDQ5089231FDOQ5089231
Authors: Kazuhiro Kurita, Yasuaki Kobayashi 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2006.16222
Title of this publication is not available (Why is that?)
Recommendations
- Efficient Algorithms for the k Smallest Cuts Enumeration
- scientific article; zbMATH DE number 2050721
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
- Computing minimum multiway cuts in hypergraphs
- Optimization via enumeration: A new algorithm for the max cut problem
- Counting the number of minimum cuts in undirected multigraphs
- Efficient enumeration of all minimal separators in a graph
- Efficiently enumerating minimal triangulations
- Minimal multicut and maximal integer multiflow: a survey
- Computing minimum multiway cuts in hypergraphs from hypertree packings
Cites Work
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Algorithmic graph theory and perfect graphs
- On multiway cut parameterized above lower bounds
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- The Complexity of Multiterminal Cuts
- FPT algorithms for path-transversal and cycle-transversal problems
- Parameterized graph separation problems
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Reverse search for enumeration
- Large Induced Subgraphs via Triangulations and CMSO
- On generating all maximal independent sets
- Efficient enumeration of all minimal separators in a graph
- 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
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Listing all Minimal Separators of a Graph
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Simple and improved parameterized algorithms for multiterminal cuts
- Primal-dual approximation algorithms for integral flow and multicut in trees
- An improved approximation algorithm of MULTIWAY CUT.
- Generating cut conjunctions in graphs and related problems
- On enumerating all minimal solutions of feedback problems
- A tight lower bound for planar multiway cut with fixed number of terminals
- A paradigm for listing \((s,t)\)-cuts in graphs
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
- Efficient algorithms for \(k\)-terminal cuts on planar graphs
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- A polynomial-time approximation scheme for planar multiway cut
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
Cited In (5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089231)
