No label defined (Q5089231)

From MaRDI portal

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: scientific article; zbMATH DE number 7559431

scientific article; zbMATH DE number 7559431

Language	Label	Description	Also known as
default for all languages	No label defined
English	No label defined	scientific article; zbMATH DE number 7559431

Statements

scholarly article

0 references

Kazuhiro Kurita

0 references

Yasuaki Kobayashi

0 references

publication date

18 July 2022

0 references

full work available at URL

https://arxiv.org/abs/2006.16222

0 references

zbMATH Keywords

multicuts

0 references

multiway cuts

0 references

enumeration algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems

0 references

Reverse search for enumeration

0 references

A polynomial-time approximation scheme for planar multiway cut

0 references

Treewidth and minimum fill-in: Grouping the minimal separators

0 references

Parameterized complexity dichotomy for \textsc{Steiner Multicut}

0 references

Efficient algorithms for \(k\)-terminal cuts on planar graphs

0 references

Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties

0 references

New polynomial delay bounds for maximal subgraph enumeration by proximity search

0 references

An improved approximation algorithm of MULTIWAY CUT.

0 references

The Complexity of Multiterminal Cuts

0 references

Large Induced Subgraphs via Triangulations and CMSO

0 references

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

0 references

Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

0 references

Primal-dual approximation algorithms for integral flow and multicut in trees

0 references

Algorithmic graph theory and perfect graphs

0 references

FPT algorithms for path-transversal and cycle-transversal problems

0 references

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs

0 references

On generating all maximal independent sets

0 references

Generating cut conjunctions in graphs and related problems

0 references

Enumerating Spanning and Connected Subsets in Graphs and Matroids

0 references

Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time

0 references

Listing all Minimal Separators of a Graph

0 references

Parameterized graph separation problems

0 references

A tight lower bound for planar multiway cut with fixed number of terminals

0 references

Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset

0 references

A paradigm for listing \((s,t)\)-cuts in graphs

0 references

On enumerating all minimal solutions of feedback problems

0 references

Efficient enumeration of all minimal separators in a graph

0 references

Multiprocessor Scheduling with the Aid of Network Flow Algorithms

0 references

Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph

0 references

An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset

0 references

Simple and improved parameterized algorithms for multiterminal cuts

0 references

Recommended article

Efficient Algorithms for the k Smallest Cuts Enumeration

Similarity Score

0.9348233

Recommender Run

Recommender Run 3

0 references

Similarity Score

0.9241492

Recommender Run

Recommender Run 3

0 references

Efficient algorithms for the problems of enumerating cuts by non-decreasing weights

Similarity Score

0.92000455

Recommender Run

Recommender Run 3

0 references

Computing minimum multiway cuts in hypergraphs

Similarity Score

0.90684193

Recommender Run

Recommender Run 3

0 references

Optimization via enumeration: A new algorithm for the max cut problem

Similarity Score

0.9030951

Recommender Run

Recommender Run 3

0 references

Counting the number of minimum cuts in undirected multigraphs

Similarity Score

0.9009086

Recommender Run

Recommender Run 3

0 references

Efficient enumeration of all minimal separators in a graph

Similarity Score

0.89857906

Recommender Run

Recommender Run 3

0 references

Efficiently enumerating minimal triangulations

Similarity Score

0.89588857

Recommender Run

Recommender Run 3

0 references

Minimal multicut and maximal integer multiflow: a survey

Similarity Score

0.8922759

Recommender Run

Recommender Run 3

0 references

Computing minimum multiway cuts in hypergraphs from hypertree packings

Similarity Score

0.89108807

Recommender Run

Recommender Run 3

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

10.4230/LIPICS.MFCS.2020.60

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5089231

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5089231&oldid=55934512"