Imagen de Portada

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kano, Takumi, Yamaguchi, Yutaro
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
por: Norose, Ryoma, et al.
Publicado: (2024)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
por: Murakami, Hitoshi, et al.
Publicado: (2024)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
por: Izumi, Taisuke, et al.
Publicado: (2023)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Exact Matching in Matrix Multiplication Time
por: Sato, Ryotaro, et al.
Publicado: (2025)

Matroid Intersection under Minimum Rank Oracle
por: Bárász, Mihály, et al.
Publicado: (2024)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
por: Dhawan, Abhishek
Publicado: (2024)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
por: Shakeri, Heman, et al.
Publicado: (2025)

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
por: Ghanbari, Babak, et al.
Publicado: (2026)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
por: Korhonen, Tuukka
Publicado: (2024)

Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
por: Izumi, Taisuke, et al.
Publicado: (2025)

Finding One Local Optimum Is Easy -- but What About Two?
por: Kobayashi, Yasuaki, et al.
Publicado: (2025)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
por: Bourneuf, Romain, et al.
Publicado: (2025)

Finding the diameter of a tree with distance queries
por: Gerbner, Dániel, et al.
Publicado: (2025)

Finding subdigraphs in digraphs of bounded directed treewidth
por: Lopes, Raul, et al.
Publicado: (2025)

Computational Complexity of Swish
por: Horiyama, Takashi, et al.
Publicado: (2026)

A Maximum Linear Arrangement Problem on Directed Graphs
por: DeVos, Matt, et al.
Publicado: (2018)

A Note on Generic Tangle Algorithms
por: Elbracht, Christian, et al.
Publicado: (2020)

On the Two Paths Theorem and the Two Disjoint Paths Problem
por: Humeau, Samuel, et al.
Publicado: (2025)

A Lower Bound for the Max Entropy Algorithm for TSP
por: Jin, Billy, et al.
Publicado: (2023)

A Faster Deterministic Approximation Algorithm for TTP-2
por: Kanaya, Yuga, et al.
Publicado: (2023)

Notes on the Linear Algebraic View of Regularity Lemmas
por: Bodwin, Greg, et al.
Publicado: (2025)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
por: Dumitrescu, Adrian
Publicado: (2024)

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
por: Leung, Yui Hin Arvin
Publicado: (2025)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
por: Jones, Mark, et al.
Publicado: (2025)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
por: Madani, Amirali, et al.
Publicado: (2025)

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

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
por: Haviv, Ishay
Publicado: (2022)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
por: Bai, Yuhang, et al.
Publicado: (2026)

Algorithmic study on liar's vertex-edge domination problem
por: Bhattacharya, Debojyoti, et al.
Publicado: (2023)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Approximate Maintenance of Maximum Subarray Sum in the Sliding Window Model
por: Suzuki, Ryo, et al.
Publicado: (2026)

A Combinatorial Characterization of Constant Mixing Time
por: Lau, Lap Chi, et al.
Publicado: (2025)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
por: Gavva, Surya Teja, et al.
Publicado: (2025)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
por: Kobayashi, Yasuaki, et al.
Publicado: (2023)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

Induced Cycles of Many Lengths
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
por: Bell, Tolson, et al.
Publicado: (2023)