352 search results - page 28 / 71 » Partitioning Graphs into Connected Parts |
155
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
152
click to vote
AAAI
2000
15 years 5 months ago
2000
We present a novel approach to plan recognition in which graph construction and analysis is used as a paradigm. We use a graph structure called a Goal Graph for the plan recogniti...
120
click to vote
LADC
2007
Springer
15 years 10 months ago
2007
Springer
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
146
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
161
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...