We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Bar...
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...