Sciweavers

241 search results - page 22 / 49
» Graphs, Hypergraphs and Hashing
Sort
View
135
Voted
WG
1995
Springer
15 years 5 months ago
Modular Decomposition of Hypergraphs
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 in O(n3k−5) time th...
Paola Bonizzoni, Gianluca Della Vedova
SCIENTOMETRICS
2010
131views more  SCIENTOMETRICS 2010»
14 years 8 months ago
Academic team formation as evolving hypergraphs
This paper quantitatively explores the social and socio-semantic patterns of constitution of academic collaboration teams. To this end, we broadly underline two critical features ...
Carla Taramasco, Jean-Philippe Cointet, Camille Ro...
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
14 years 11 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
FOCS
1992
IEEE
15 years 6 months ago
Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths
Miklós Ajtai, Noga Alon, Jehoshua Bruck, Ro...