1632 search results - page 11 / 327 » On special numberings of hypergraphs |
157
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
113
click to vote
DAM
2008
15 years 6 months ago
2008
We consider vertex coloring of an acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural wa...
195
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
157
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
172
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...