1951 search results - page 126 / 391 » An algorithm for improving graph partitions |
141
Voted
WEA
2010
Springer
15 years 11 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
129
click to vote
NETWORKING
2004
15 years 5 months ago
2004
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
130
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
123
click to vote
SIROCCO
2007
15 years 6 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
146
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...