239 search results - page 21 / 48 » The path partition problem and related problems in bipartite... |
CCCG
2007
13 years 9 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
SIROCCO
2004
13 years 9 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
DAM
2011
13 years 2 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
CDC
2009
IEEE
14 years 8 days ago
2009
IEEE
— The paper studies the coordinated path following problem, namely, steering a group of unicycles to a given path while achieving an inter-vehicle formation pattern. A novel hybr...
ALENEX
2004
13 years 9 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...