77 search results - page 6 / 16 » The Zeta Function of a Hypergraph |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
EJC
2008
13 years 7 months ago
2008
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
WG
1993
Springer
13 years 11 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
DM
2010
13 years 7 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and