2503 search results - page 52 / 501 » A study of 3-arc graphs |
157
click to vote
RSA
2002
15 years 5 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
153
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
156
click to vote
WG
2009
Springer
16 years 13 days ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
164
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
205
click to vote
PODC
2011
ACM
14 years 8 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...