1027 search results - page 28 / 206 » Ordered Vertex Partitioning |
133
click to vote
WG
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
131
click to vote
SIAMCOMP
2002
15 years 2 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
117
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
122
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
107
click to vote
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We describe an ensemble approach to learning1 salient regions from data partitioned according to the2 distributed processing requirements of large-scale sim-3 ulations. The volume...