1952 search results - page 137 / 391 » Complete partitions of graphs |
129
click to vote
JSSPP
2009
Springer
15 years 11 months ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
134
click to vote
CORR
2006
Springer
15 years 4 months 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...
129
click to vote
SEMWEB
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Topic Maps and RDF are two independently developed paradigms and standards for the representation, interchange, and exploitation of model-based data on the web. Each para...
169
click to vote
COMBINATORICA
2010
14 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
155
click to vote
SPAA
1997
ACM
15 years 8 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...