Imagen de Portada

Preprocessing to Reduce the Search Space for Odd Cycle Transversal

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jansen, Bart M. P., Mizutani, Yosuke, Sullivan, Blair D., Verhaegh, Ruben F. A.
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

Search-Space Reduction Via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
por: Jansen, Bart M. P., et al.
Publicado: (2024)

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
por: Donkers, Huib, et al.
Publicado: (2021)

Search-space Reduction for Boolean MinCSPs via Essential Constraints
por: Jansen, Bart M. P., et al.
Publicado: (2026)

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange
por: Jansen, Bart M. P., et al.
Publicado: (2025)

A Space-Efficient Algebraic Approach to Robotic Motion Planning
por: Bentert, Matthias, et al.
Publicado: (2024)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
por: Bentert, Matthias, et al.
Publicado: (2025)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
por: Crane, Alex, et al.
Publicado: (2026)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
por: Mizutani, Yosuke, et al.
Publicado: (2024)

Preprocessed 3SUM for Unknown Universes with Subquadratic Space
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

Odd and Even Harder Problems on Cycle-Factors
por: Hörsch, Florian, et al.
Publicado: (2025)

Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width
por: Bojikian, Narek, et al.
Publicado: (2024)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
por: Crane, Alex, et al.
Publicado: (2023)

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
por: Kano, Takumi, et al.
Publicado: (2026)

3SUM in Preprocessed Universes: Faster and Simpler
por: Kasliwal, Shashwat, et al.
Publicado: (2024)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Online Coloring for Graphs of Large Odd Girth
por: Yoneda, Hirotaka, et al.
Publicado: (2026)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

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

Distance Adjustment of a Graph Drawing Stress Model
por: Onoue, Yosuke
Publicado: (2024)

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

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
por: Rutschmann, Daniel
Publicado: (2026)

Packing Short Cycles
por: Bentert, Matthias, et al.
Publicado: (2024)

Equalizing Closeness Centralities via Edge Additions
por: Crane, Alex, et al.
Publicado: (2025)

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
por: Adriaens, Florian, et al.
Publicado: (2026)

Cycle Basis Algorithms for Reducing Maximum Edge Participation
por: Wang, Fan, et al.
Publicado: (2025)

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
por: Löffler, Maarten, et al.
Publicado: (2026)

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
por: McCauley, Samuel
Publicado: (2024)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
por: Elberfeld, Michael, et al.
Publicado: (2025)

Data Structures Meet Cryptography: 3SUM with Preprocessing
por: Golovnev, Alexander, et al.
Publicado: (2019)

The S-Hamiltonian Cycle Problem
por: Amarilli, Antoine, et al.
Publicado: (2026)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
por: Jang, Jihoon, et al.
Publicado: (2025)

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
por: Dasdan, Ali
Publicado: (2025)

Fast Approximate Counting of Cycles
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling
por: Jansen, Klaus, et al.
Publicado: (2026)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
por: Yu, Kaiqiang, et al.
Publicado: (2025)

A $(4/3+\varepsilon)$-Approximation for Preemptive Scheduling with Batch Setup Times
por: Deppert, Max A., et al.
Publicado: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
por: Crane, Alex, et al.
Publicado: (2025)

Listing 6-Cycles in Sparse Graphs
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class
por: Grandjean, Étienne, et al.
Publicado: (2025)