1538 search results - page 119 / 308 » Spectral Techniques in Graph Algorithms |
130
click to vote
TEC
2002
15 years 1 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
WABI
2007
Springer
15 years 7 months ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
124
click to vote
PAMI
2008
15 years 1 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
124
click to vote
ATMOS
2007
15 years 3 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
111
click to vote
ALENEX
2007
15 years 3 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...