6592 search results - page 35 / 1319 » On robust cycle bases |
101
click to vote
ADHOCNETS
2010
Springer
14 years 8 months ago
2010
Springer
The current specification for IEEE 802.15.4 beacon-enabled networks does not define how active and sleep schedules should be configured in order to achieve the optimal network perf...
111
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
109
click to vote
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
113
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...