95 search results - page 13 / 19 » Covering a hypergraph of subgraphs |
ALGORITHMICA
2005
14 years 11 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
MST
2007
14 years 11 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
96
Voted
DAM
2010
14 years 11 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
129
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
ACSC
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...