2796 search results - page 332 / 560 » The coolest path problem |
249
click to vote
EOR
2006
15 years 6 months ago
2006
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
153
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
135
click to vote
ENDM
2007
15 years 6 months ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
168
click to vote
MP
2008
15 years 6 months ago
2008
We consider two notions for the representations of convex cones: G-representation and liftedG-representation. The former represents a convex cone as a slice of another; the latter...
209
click to vote
AROBOTS
2002
15 years 6 months ago
2002
The potential field method is widely used for autonomous mobile robot path planning due to its elegant mathematical analysis and simplicity. However, most researches have been focu...