2796 search results - page 220 / 560 » The coolest path problem |
155
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
172
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for sy...
177
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
159
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...
162
click to vote
RSA
2010
15 years 5 months ago
2010
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...