1327 search results - page 215 / 266 » Path following algorithm for the graph matching problem |
102
Voted
PSB
2004
15 years 3 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
STACS
2000
Springer
15 years 5 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
IJPP
2008
15 years 1 months ago
2008
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
128
click to vote
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
Multi-agent research often borrows from biology, where remarkable examples of collective intelligence may be found. One interesting example is ant colonies’ use of pheromones as...