6592 search results - page 7 / 1319 » On robust cycle bases |
GD
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
JUCS
2010
14 years 8 months ago
2010
: Recent work on social networks has tackled the measurement and optimization of these networks’ robustness and resilience to both failures and attacks. Different metrics have be...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
100
click to vote
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...