649 search results - page 14 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
IPL
2006
13 years 8 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
FCT
2005
Springer
14 years 2 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
SAC
2000
ACM
14 years 1 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
ICALP
2011
Springer
13 years 7 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
SODA
2007
ACM
13 years 10 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...