Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gomes, Guilherme C. M., Juliano, Emanuel, Martins, Gabriel, Santos, Vinicius F. dos
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Enumeration kernels for Vertex Cover and Feedback Vertex Set
por: Bougeret, Marin, et al.
Publicado: (2025)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
por: Castelo, Emanuel, et al.
Publicado: (2025)

String Matching with a Dynamic Pattern
por: Monteiro, Bruno, et al.
Publicado: (2025)

An FPT algorithm for Matching Cut and d-cut
por: Aravind, N R, et al.
Publicado: (2021)

Enumeration Algorithms for Conjunctive Queries with Projection
por: Deep, Shaleen, et al.
Publicado: (2021)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
por: Conte, Alessio, et al.
Publicado: (2024)

Semi-Robust Communication Complexity of Maximum Matching
por: Huete, Gabriel Cipriani, et al.
Publicado: (2025)

Cut-Query Algorithms with Few Rounds
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Complexity and Algorithm for the Matching vertex-cutset Problem
por: Li, Hengzhe, et al.
Publicado: (2025)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
por: Saxena, Raghuvansh R., et al.
Publicado: (2024)

A Simple and Fast Algorithm for Fair Cuts
por: Li, Jason, et al.
Publicado: (2024)

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
por: Menand, Nicolas, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2025)

The Complexity of Maximal Common Subsequence Enumeration
por: Buzzega, Giovanni, et al.
Publicado: (2025)

Algorithms for Parameterized String Matching with Mismatches
por: Saha, Apurba, et al.
Publicado: (2024)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
por: Kurita, Kazuhiro, et al.
Publicado: (2022)

Space Complexity of Minimum Cut Problems in Single-Pass Streams
por: Ding, Matthew, et al.
Publicado: (2024)

A Critical Pair Enumeration Algorithm for String Diagram Rewriting
por: Matsui, Anna, et al.
Publicado: (2026)

Transversal Rank, Conformality and Enumeration
por: Schirneck, Martin
Publicado: (2026)

Revisiting Directed Disjoint Paths on tournaments (and relatives)
por: Gomes, Guilherme C. M., et al.
Publicado: (2025)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
por: Bougeret, Marin, et al.
Publicado: (2026)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
por: Hwang, Samuel, et al.
Publicado: (2024)

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
por: Ferdous, S M, et al.
Publicado: (2023)

Engineering Hypergraph $b$-Matching Algorithms
por: Großmann, Ernestine, et al.
Publicado: (2024)

Efficient Parallel Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2026)

On the Advice Complexity of Online Matching on the Line
por: Csaba, Béla, et al.
Publicado: (2024)

Minimum $s$--$t$ Cuts with Fewer Cut Queries
por: Jiang, Yonggang, et al.
Publicado: (2025)

From Amortized to Worst Case Delay in Enumeration Algorithms
por: Capelli, Florent, et al.
Publicado: (2021)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
por: Kurita, Kazuhiro, et al.
Publicado: (2025)

Efficient Kernelization Algorithm for Bipartite Graph Matching
por: Wu, Guang, et al.
Publicado: (2024)

The Communication Complexity of Pattern Matching with Edits Revisited
por: Kociumaka, Tomasz, et al.
Publicado: (2026)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Pattern Matching with Mismatches and Wildcards
por: Bathie, Gabriel, et al.
Publicado: (2024)

Selection Improvements on the Parallel Iterative Algorithm for Stable Matching
por: Wynn, Scott, et al.
Publicado: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
por: Liu, Yuxi, et al.
Publicado: (2023)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
por: Dufay, Marc, et al.
Publicado: (2025)

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

Streaming Max-Cut in General Metrics
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Enumerating All Directed Spanning Trees in Optimal Time
por: Gawrychowski, Paweł, et al.
Publicado: (2026)

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
por: Nägele, Martin, et al.
Publicado: (2026)