arXiv (All)
open access
Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing approaches include exact algorithms with exponential runtimes, approximation algorithms limited to specific graph classes, a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An FPT algorithm for cycle rank on semi-complete digraphs#1062946
- Graph-Based Gene Genomics Analysis#632394
- NP-Hardness and a Fixed-Parameter Algorithm for Translocation Distance#1012583
- Leveraging SMT Solvers for Reachability Analysis#929246
- Extending Cartesian Genetic Programming via iterative subgraph assessment / Henning Cui, Camilo De La Torre, Sylvain Cussat-Blanc, Hervé Luga, Dennis G. Wilson, Jörg Hähner ; Herausgeber: Francesco Marcelloni, Kurosh Madani, Niki van Stein, Joaquim Filipe#1106502
Record · ID 1048544
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive