2310 search results - page 348 / 462 » Coloring Random Graphs |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
JITECH
2010
13 years 6 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
TIT
2010
13 years 2 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
This paper presents a new technique to reduce the storage cost of high quality 3D video. In 3D video [12], a sequence of 3D objects represents scenes in motion. Every frame is com...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...