Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

FCS
2006

favoriteEmaildiscussreport

240views Computer Science» more FCS 2006»

Negative-Weight Cycle Algorithms

13 years 5 months ago

Negative-Weight Cycle Algorithms

Download ww1.ucmss.com

The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with the running time no worse than the Bellman-Ford algorithm for the single-source shortest-path problem, is presented. Then an approach with the same time complexity, which could be used for outputting a negative cycle that may not be reachable from s, is reported.

Xiuzhen Huang

Real-time Traffic

Directed Graph | FCS 2006 | FCS 2007 | Negative Cycle | Single-source Shortest-path Problem |

claim paper

Related Content

» Negative weights make adversaries stronger

» Algorithms for the edgewidth of an embedded graph

» Joint Duty Cycle Scheduling Resource Allocation and Multiconstrained QoS Routing Algorithm

» The Insights of DVBased Localization Algorithms in the Wireless Sensor Networks with DutyC...

» DCLA A DutyCycle Learning Algorithm for IEEE 802154 BeaconEnabled WSNs

» Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions

» A New ILPBased pCycle Construction Algorithm without Candidate Cycle Enumeration

» Compression via matroids a randomized polynomial kernel for odd cycle transversal

» On the Matching Problem for Special Graph Classes

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2006
Where	FCS
Authors	Xiuzhen Huang

Comments (0)