1221 search results - page 123 / 245 » Balanced graph partitioning |
SEMWEB
2001
Springer
14 years 2 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...
COMBINATORICA
2010
13 years 5 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...
SPAA
1997
ACM
14 years 2 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 (...
ENDM
2002
13 years 10 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...