Cover Image

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Dasdan, Ali
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Kernighan-Lin Search Algorithm
by: Dasdan, Ali
Published: (2025)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
by: Bauernöppel, Frank, et al.
Published: (2025)

A Tight Lower Bound for Cycle Detection in Grid Graphs
by: Au, Andrew
Published: (2026)

Improved Lower Bounds on the Expected Length of Longest Common Subsequences
by: Heineman, George T., et al.
Published: (2024)

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

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
by: Björklund, Andreas, et al.
Published: (2023)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
by: Zhao, Jingyang, et al.
Published: (2023)

Near-Optimal Four-Cycle Counting in Graph Streams
by: Lüderssen, Sebastian, et al.
Published: (2026)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2023)

A Bottom-Up Algorithm for Negative-Weight SSSP with Integrated Negative Cycle Finding
by: Li, Jason, et al.
Published: (2024)

Packing Short Cycles
by: Bentert, Matthias, et al.
Published: (2024)

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

Faster Algorithms for Longest Common Substring
by: Charalampopoulos, Panagiotis, et al.
Published: (2021)

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

Range Longest Increasing Subsequence and its Relatives
by: S., Karthik C., et al.
Published: (2024)

Dynamic Longest Common Substring in Polylogarithmic Time
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)

PageRank Centrality in Directed Graphs with Bounded In-Degree
by: Thorup, Mikkel, et al.
Published: (2025)

Improved Bounds with a Simple Algorithm for Edge Estimation for Graphs of Unknown Size
by: Chanda, Debarshi
Published: (2025)

Longest Unbordered Factors on Run-Length Encoded Strings
by: Sekizaki, Shoma, et al.
Published: (2025)

Longest Common Extensions with Wildcards: Trade-off and Applications
by: Bathie, Gabriel, et al.
Published: (2024)

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

Incremental Topological Ordering and Cycle Detection with Predictions
by: McCauley, Samuel, et al.
Published: (2024)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
by: Assadi, Sepehr, et al.
Published: (2025)

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
by: Li, Rao
Published: (2024)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
by: Kobayashi, Yusuke, et al.
Published: (2026)

Simple and Optimal Sublinear Algorithms for Mean Estimation
by: Bertolotti, Beatrice, et al.
Published: (2024)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal
by: Jansen, Bart M. P., et al.
Published: (2024)

Survey of Results on the ModPath and ModCycle Problems
by: Amarilli, Antoine
Published: (2024)

Longest Common Extension of a Dynamic String in Parallel Constant Time
by: Albert, Daniel
Published: (2026)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
by: Zhao, Jingyang, et al.
Published: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
by: Gahlawat, Harmender, et al.
Published: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2025)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
by: An, Shinwoo, et al.
Published: (2024)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
by: Rahat, Md. Tanzeem, et al.
Published: (2025)

Approximating Optimum Online for Capacitated Resource Allocation
by: Braun, Alexander, et al.
Published: (2024)

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
by: Boneh, Itai, et al.
Published: (2025)

Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs
by: Hillebrand, Quentin, et al.
Published: (2024)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
by: Chen, Kuowen, et al.
Published: (2025)

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