Sciweavers

870 search results - page 124 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
STTT
2010
132views more  STTT 2010»
14 years 8 months ago
Evaluation of Kermeta for solving graph-based problems
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...
CVPR
2000
IEEE
15 years 11 months ago
Fixed Topology Skeletons
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...
Polina Golland, W. Eric L. Grimson
ADAEUROPE
2004
Springer
15 years 3 months ago
On the Tree Width of Ada Programs
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...
INFOCOM
2008
IEEE
15 years 4 months ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—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...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov