Image de couverture de livre

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bauernöppel, Frank, Sack, Jörg-Rüdiger
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Revisiting Path Contraction and Cycle Contraction
par: Krithika, R., et autres
Publié: (2024)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
par: Chuzhoy, Julia, et autres
Publié: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
par: Balzotti, Lorenzo
Publié: (2020)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
par: Kammer, Frank, et autres
Publié: (2020)

Simple in-place yet comparison-optimal Mergesort
par: Siebert, Christian
Publié: (2025)

Fast and Simple Sorting Using Partial Information
par: Haeupler, Bernhard, et autres
Publié: (2024)

A Tight Lower Bound for Comparison-Based Quantile Summaries
par: Cormode, Graham, et autres
Publié: (2019)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
par: Fekete, Sándor P., et autres
Publié: (2024)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
par: Ahn, Jungho, et autres
Publié: (2025)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
par: Duan, Ran, et autres
Publié: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
par: Hommelsheim, Felix, et autres
Publié: (2025)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
par: Grandoni, Fabrizio, et autres
Publié: (2024)

On Hardness and Approximation of Broadcasting in Structured Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Colorful Vertex Recoloring of Bipartite Graphs
par: Patt-Shamir, Boaz, et autres
Publié: (2025)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
par: Roditty, Liam, et autres
Publié: (2026)

Graph Threading
par: Demaine, Erik D., et autres
Publié: (2023)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
par: DeHaan, Ian, et autres
Publié: (2024)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
par: Dreier, Jan, et autres
Publié: (2026)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

A Simple yet Exact Analysis of the MultiQueue
par: Walzer, Stefan, et autres
Publié: (2024)

Minimizing the Weighted Makespan with Restarts on a Single Machine
par: Amouzandeh, Aflatoun, et autres
Publié: (2025)

On the Approximability of Unsplittable Flow on a Path with Time Windows
par: Armbruster, Alexander, et autres
Publié: (2025)

Search and evacuation with a near majority of faulty agents
par: Czyzowicz, J., et autres
Publié: (2026)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
par: Goswami, Mayank, et autres
Publié: (2022)

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
par: Emmerich, Michael
Publié: (2025)

Hierarchical Exponential Search Via K-Spines
par: Dong, Bob
Publié: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
par: Bouchard, Sébastien, et autres
Publié: (2025)

Fast Order Statistics with Group Inequality Testing
par: Liyanage, Adiesha, et autres
Publié: (2025)