4926 search results - page 117 / 986 » Two Graph Algorithms On an Associative Computing Model |
127
click to vote
WEA
2009
Springer
15 years 9 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
148
Voted
TVCG
2012
13 years 5 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
96
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
134
Voted
COLOGNETWENTE
2007
15 years 4 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
126
Voted
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...