We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute efficiently the decomposition of hypergraphs of fixed dimension k

Bonizzoni, P., DELLA VEDOVA, G. (1995). Modular Decomposition of Hypergraphs. In Graph-Theoretic Concepts in Computer Science, 21st International Workshop (pp.304-317). Springer Verlag [10.1007/3-540-60618-1_84].

Modular Decomposition of Hypergraphs

BONIZZONI, PAOLA;DELLA VEDOVA, GIANLUCA
1995

Abstract

We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute efficiently the decomposition of hypergraphs of fixed dimension k
No
paper
Scientifica
Modular decomposition
English
International Workshop on Graph-Theoretic Concepts in Computer Science, WG 20-22 June
3-540-60618-1
Bonizzoni, P., DELLA VEDOVA, G. (1995). Modular Decomposition of Hypergraphs. In Graph-Theoretic Concepts in Computer Science, 21st International Workshop (pp.304-317). Springer Verlag [10.1007/3-540-60618-1_84].
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/32148
Citazioni
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
Social impact