8 search results - page 2 / 2 » A polynomial solution to the k-fixed-endpoint path cover pro... |
TCS
2008
13 years 5 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
WALCOM
2010
IEEE
14 years 9 days ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
TASE
2010
IEEE
13 years 1 days ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...