688 search results - page 45 / 138 » General Partitioning on Random Graphs |
113
Voted
DM
2011
14 years 7 months ago
2011
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
76
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
126
click to vote
FCCM
1997
IEEE
15 years 4 months ago
1997
IEEE
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
94
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
105
click to vote
APN
2005
Springer
15 years 6 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...