Sciweavers

376 search results - page 6 / 76
» Completely connected clustered graphs
Sort
View
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
DAM
2002
76views more  DAM 2002»
13 years 7 months ago
Block duplicate graphs and a hierarchy of chordal graphs
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
Martin Charles Golumbic, Uri N. Peled
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
13 years 7 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...
CDC
2008
IEEE
122views Control Systems» more  CDC 2008»
14 years 2 months ago
On the number of leaders needed to ensure network connectivity
— 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...
Dimos V. Dimarogonas, Tove Gustavi, Magnus Egerste...
TAMC
2009
Springer
14 years 5 days ago
Feasibility of Motion Planning on Directed Graphs
Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning o...
Zhilin Wu, Stéphane Grumbach