Results 1  10
of
171,014
Rainbow paths with prescribed ends
 Electron. J. Combin
, 2011
"... It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex coloring of graphs. Preprint] that, if G is a connected graph distinct from C7, then there is a χ(G)coloring of G in which every vertex v ∈ V (G) is an initial vertex of a path P with χ(G) vertices whose col ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex coloring of graphs. Preprint] that, if G is a connected graph distinct from C7, then there is a χ(G)coloring of G in which every vertex v ∈ V (G) is an initial vertex of a path P with χ(G) vertices whose
Analysis of Probabilistic Roadmaps for Path Planning
, 1998
"... We provide an analysis of a recent path planning method which uses probabilistic roadmaps. This method has proven very successful in practice, but the theoretical un derstanding of its performance is still limited. Assuming that a path 7 exists between two configurations a and b of the robot, we ..."
Abstract

Cited by 128 (14 self)
 Add to MetaCart
We provide an analysis of a recent path planning method which uses probabilistic roadmaps. This method has proven very successful in practice, but the theoretical un derstanding of its performance is still limited. Assuming that a path 7 exists between two configurations a and b of the robot
PATH
, 1993
"... The contents of this report reflect the views of the authors who are responsible for the facts and the accuracy of the data presented herein. The contents do not necessarily reflect the official views or policies of the State of California. This report does not constitute a standard, specification, ..."
Abstract
 Add to MetaCart
The contents of this report reflect the views of the authors who are responsible for the facts and the accuracy of the data presented herein. The contents do not necessarily reflect the official views or policies of the State of California. This report does not constitute a standard, specification, or regulation.
Quantum algorithms revisited
 Proceedings of the Royal Society of London A
, 1998
"... Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use th ..."
Abstract

Cited by 188 (16 self)
 Add to MetaCart
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use
with prescribed vertices in given position
, 2011
"... The paths embedding of the arrangement graphs ..."
PATH COVERINGS WITH PRESCRIBED ENDS IN FAULTY HYPERCUBES
"... We discuss the existence of vertex disjoint path coverings with prescribed ends for the ndimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path coverings we establish the minimal integer m such that for every ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We discuss the existence of vertex disjoint path coverings with prescribed ends for the ndimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path coverings we establish the minimal integer m such that for every
On Hamiltonian Paths with Prescribed edge lengths in the Complete Graph
 Bull. Inst. Combin. Appl
, 2010
"... Marco Buratti has conjectured that given p a prime and a multiset S containing p 1 nonzero elements from Zp, there exists a Hamiltonian path in Kp where the multiset of edge lengths is S. In this paper we completely solve this conjecture when S contains at most two distinct values. 1 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Marco Buratti has conjectured that given p a prime and a multiset S containing p 1 nonzero elements from Zp, there exists a Hamiltonian path in Kp where the multiset of edge lengths is S. In this paper we completely solve this conjecture when S contains at most two distinct values. 1
Results 1  10
of
171,014