On the Complexity of Strongly Connected Components in Directed Hypergraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithmica Year : 2014

Dates and versions

hal-00782846 , version 1 (30-01-2013)

Identifiers

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⟩
163 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More