244 search results - page 19 / 49 » Intervalizing k-Colored Graphs |
TECS
2010
14 years 9 months ago
2010
141
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
133
click to vote
JUCS
2002
15 years 2 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
107
Voted
IPL
2010
15 years 1 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
119
click to vote
SIROCCO
1998
15 years 3 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...