6598 search results - page 45 / 1320 » Graph Theory with Applications |
178
click to vote
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
152
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
130
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
220
click to vote
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
194
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...