1221 search results - page 21 / 245 » Balanced graph partitioning |
109
click to vote
SOFSEM
2005
Springer
15 years 5 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
120
click to vote
EUROPAR
2008
Springer
15 years 1 months ago
2008
Springer
This work is devoted to the numerical resolution of the 4D Vlasov equation using an adaptive mesh of phase space. We previously proposed a parallel algorithm designed for distribut...
106
click to vote
TPDS
2008
14 years 11 months ago
2008
Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, lo...
100
click to vote
DAC
2001
ACM
16 years 23 days ago
2001
ACM
Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IP...
DM
2010
14 years 12 months ago
2010
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...