arXiv (All)
open access
An FPT algorithm for cycle rank on semi-complete digraphs
Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the problem of determining if a given digraph has cycle rank at most $w$ is fixed-parameter tractable parameterized by $w$. We provide such al
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
- Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means#1048544
- New transience bounds for long walks in weighted digraphs#629686
- 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
- Peter J. Weber Papers#808344
- André Mellerio Papers#808415
Record · ID 1062946
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