139 search results - page 18 / 28 » Introduction to Testing Graph Properties |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
STOC
1998
ACM
15 years 1 months ago
1998
ACM
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Rigidity of formation is an importance concept in multi-agent localization and control problems. There are welldeveloped existing methods to test the rigidity of a given graph....
ISCAPDCS
2004
14 years 11 months ago
2004
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...