Sciweavers

649 search results - page 11 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
FCS
2006
14 years 10 months ago
Negative-Weight Cycle Algorithms
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 th...
Xiuzhen Huang
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 2 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
IPL
2006
151views more  IPL 2006»
14 years 9 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier
ISAAC
1993
Springer
134views Algorithms» more  ISAAC 1993»
15 years 1 months ago
Weighted Independent Perfect Domination on Cocomparability Graphs
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
SWAT
1990
Springer
72views Algorithms» more  SWAT 1990»
15 years 1 months ago
Generating Sparse Spanners for Weighted Graphs
Ingo Althöfer, Gautam Das, David P. Dobkin, D...