1605 search results - page 10 / 321 » On Partitional Labelings of Graphs |
ENDM
2007
13 years 8 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
GFKL
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
SSS
2010
Springer
13 years 7 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
GD
2006
Springer
14 years 7 days ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
ADC
2008
Springer
14 years 2 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...