We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension three and show how this algorithm can be generalized to compute in O(n3k-5) time the decomposition of hypergraphs of any fixed dimension k. © 1999 Academic Press.

Bonizzoni, P., DELLA VEDOVA, G. (1999). An algorithm for the modular decomposition of hypergraphs. JOURNAL OF ALGORITHMS, 32, 65-86 [10.1006/jagm.1999.1016].

An algorithm for the modular decomposition of hypergraphs

BONIZZONI, PAOLA;DELLA VEDOVA, GIANLUCA
1999

Abstract

We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension three and show how this algorithm can be generalized to compute in O(n3k-5) time the decomposition of hypergraphs of any fixed dimension k. © 1999 Academic Press.
Articolo in rivista - Articolo scientifico
algorithm, modular, decomposition, hypergraphs
English
65
86
22
Bonizzoni, P., DELLA VEDOVA, G. (1999). An algorithm for the modular decomposition of hypergraphs. JOURNAL OF ALGORITHMS, 32, 65-86 [10.1006/jagm.1999.1016].
Bonizzoni, P; DELLA VEDOVA, G
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/34049
Citazioni
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 5
Social impact