1729 search results - page 220 / 346 » On Bounds for the k-Partitioning of Graphs |
181
click to vote
PAMI
2006
15 years 6 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
171
click to vote
JCO
2007
15 years 6 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
124
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
146
click to vote
CDC
2008
IEEE
16 years 25 days ago
2008
IEEE
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...