376 search results - page 5 / 76 » Completely connected clustered graphs |
144
click to vote
ALT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
SIAMDM
2010
14 years 8 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
98
Voted
GD
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
138
Voted
COLOGNETWENTE
2010
14 years 10 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
128
click to vote
JCT
2010
15 years 8 days ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...