829 search results - page 113 / 166 » Distance domination-critical graphs |
106
click to vote
PAMI
2006
14 years 11 months ago
2006
High dimensional structured data such as text and images is often poorly understood and misrepresented in statistical modeling. The standard histogram representation suffers from ...
75
Voted
DAM
2008
14 years 12 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
115
click to vote
SIAMJO
2008
14 years 11 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
SPDP
1990
IEEE
15 years 3 months ago
1990
IEEE
In this paper, we propose a semi distributed approach, for load balancing in large parallel and distributedsystems. Theproposedschemeisa twolevel hierarchical scheme which partiti...
CCCG
2009
15 years 29 days ago
2009
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...