1605 search results - page 8 / 321 » On Partitional Labelings of Graphs |
SIAMDM
2000
13 years 8 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
KDD
2005
ACM
14 years 2 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
INFFUS
2008
13 years 8 months ago
2008
act 11 We describe an ensemble approach to learning from arbitrarily partitioned data. The partitioning comes from the distributed process12 ing requirements of a large scale simul...
JAL
2006
13 years 8 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...