1986 search results - page 129 / 398 » Path Separability of Graphs |
AAAI
2010
13 years 10 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
IPL
2008
13 years 9 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
LATIN
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
EDBTW
2006
Springer
14 years 19 days ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
BROADNETS
2006
IEEE
14 years 3 months ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...