Journal Articles
Algorithmica
Year : 2014
Canimogy Cogoulane : Connect in order to contact the contributor
https://inria.hal.science/hal-00782846
Submitted on : Wednesday, January 30, 2013-4:46:45 PM
Last modification on : Friday, March 24, 2023-2:52:56 PM
Dates and versions
Identifiers
- HAL Id : hal-00782846 , version 1
- ARXIV : 1112.1444
- DOI : 10.1007/s00453-012-9729-0
Cite
Xavier Allamigeon. On the Complexity of Strongly Connected Components in Directed Hypergraphs. Algorithmica, 2014, 69 (2), pp.335-369. ⟨10.1007/s00453-012-9729-0⟩. ⟨hal-00782846⟩
162
View
0
Download