Sciweavers

983 search results - page 36 / 197
» Negative-Weight Cycle Algorithms
Sort
View
TPDS
2008
199views more  TPDS 2008»
15 years 3 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras
INFOCOM
2008
IEEE
15 years 9 months ago
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwa...
IPPS
2005
IEEE
15 years 8 months ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— 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...
Chih-fan Hsin, Mingyan Liu
RTSS
2009
IEEE
15 years 10 months ago
Spatiotemporal Delay Control for Low-Duty-Cycle Sensor Networks
—Data delivery is a major function of sensor network applications. Many applications, such as military surveillance, require the detection of interested events to be reported to ...
Yu Gu, Tian He, Mingen Lin, Jinhui Xu
ICALP
2000
Springer
15 years 6 months ago
Computing the Girth of a Planar Graph
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
Hristo Djidjev