241 search results - page 4 / 49 » Graphs, Hypergraphs and Hashing |
IPCO
2010
13 years 7 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
SBBD
2007
13 years 7 months ago
2007
In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets o...
ACMMSP
2004
ACM
13 years 11 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
DM
2000
13 years 5 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
COMBINATORICS
2002
13 years 5 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...