Skip to Main content Skip to Navigation
Journal articles

On the Complexity of Strongly Connected Components in Directed Hypergraphs

Xavier Allamigeon 1, 2, *
* Corresponding author
1 MAXPLUS - Max-plus algebras and mathematics of decision
CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique, Inria Saclay - Ile de France
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-00782846
Contributor : Canimogy Cogoulane <>
Submitted on : Wednesday, January 30, 2013 - 4:46:45 PM
Last modification on : Thursday, March 5, 2020 - 6:28:06 PM

Links full text

Identifiers

Collections

Citation

Xavier Allamigeon. On the Complexity of Strongly Connected Components in Directed Hypergraphs. Algorithmica, Springer Verlag, 2014, 69 (2), pp.335-369. ⟨10.1007/s00453-012-9729-0⟩. ⟨hal-00782846⟩

Share

Metrics

Record views

500