On the Complexity of Strongly Connected Components in Directed Hypergraphs - Département de mathématiques appliquées Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2014

On the Complexity of Strongly Connected Components in Directed Hypergraphs

Dates et versions

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

Identifiants

Citer

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 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More