Image de couverture de livre

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gomes, Guilherme C. M., Juliano, Emanuel, Martins, Gabriel, Santos, Vinicius F. dos
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Enumeration kernels for Vertex Cover and Feedback Vertex Set
par: Bougeret, Marin, et autres
Publié: (2025)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
par: Castelo, Emanuel, et autres
Publié: (2025)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

An FPT algorithm for Matching Cut and d-cut
par: Aravind, N R, et autres
Publié: (2021)

Enumeration Algorithms for Conjunctive Queries with Projection
par: Deep, Shaleen, et autres
Publié: (2021)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
par: Conte, Alessio, et autres
Publié: (2024)

Semi-Robust Communication Complexity of Maximum Matching
par: Huete, Gabriel Cipriani, et autres
Publié: (2025)

Cut-Query Algorithms with Few Rounds
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Complexity and Algorithm for the Matching vertex-cutset Problem
par: Li, Hengzhe, et autres
Publié: (2025)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
par: Saxena, Raghuvansh R., et autres
Publié: (2024)

A Simple and Fast Algorithm for Fair Cuts
par: Li, Jason, et autres
Publié: (2024)

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
par: Menand, Nicolas, et autres
Publié: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2025)

The Complexity of Maximal Common Subsequence Enumeration
par: Buzzega, Giovanni, et autres
Publié: (2025)

Algorithms for Parameterized String Matching with Mismatches
par: Saha, Apurba, et autres
Publié: (2024)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
par: Kurita, Kazuhiro, et autres
Publié: (2022)

Space Complexity of Minimum Cut Problems in Single-Pass Streams
par: Ding, Matthew, et autres
Publié: (2024)

A Critical Pair Enumeration Algorithm for String Diagram Rewriting
par: Matsui, Anna, et autres
Publié: (2026)

Transversal Rank, Conformality and Enumeration
par: Schirneck, Martin
Publié: (2026)

Revisiting Directed Disjoint Paths on tournaments (and relatives)
par: Gomes, Guilherme C. M., et autres
Publié: (2025)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
par: Bougeret, Marin, et autres
Publié: (2026)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
par: Hwang, Samuel, et autres
Publié: (2024)

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
par: Ferdous, S M, et autres
Publié: (2023)

Engineering Hypergraph $b$-Matching Algorithms
par: Großmann, Ernestine, et autres
Publié: (2024)

Efficient Parallel Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2026)

On the Advice Complexity of Online Matching on the Line
par: Csaba, Béla, et autres
Publié: (2024)

Minimum $s$--$t$ Cuts with Fewer Cut Queries
par: Jiang, Yonggang, et autres
Publié: (2025)

From Amortized to Worst Case Delay in Enumeration Algorithms
par: Capelli, Florent, et autres
Publié: (2021)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
par: Kurita, Kazuhiro, et autres
Publié: (2025)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

The Communication Complexity of Pattern Matching with Edits Revisited
par: Kociumaka, Tomasz, et autres
Publié: (2026)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
par: Brakensiek, Joshua, et autres
Publié: (2026)

Pattern Matching with Mismatches and Wildcards
par: Bathie, Gabriel, et autres
Publié: (2024)

Selection Improvements on the Parallel Iterative Algorithm for Stable Matching
par: Wynn, Scott, et autres
Publié: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
par: Liu, Yuxi, et autres
Publié: (2023)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
par: Dufay, Marc, et autres
Publié: (2025)

Parallel Algorithm For Finding The Minimum s/t Cut in a Structured 3-Dimensional Proper Order Graph
par: Chandramouli, Shridharan
Publié: (2026)

Streaming Max-Cut in General Metrics
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

Enumerating All Directed Spanning Trees in Optimal Time
par: Gawrychowski, Paweł, et autres
Publié: (2026)

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
par: Nägele, Martin, et autres
Publié: (2026)