2446 search results - page 363 / 490 » Choiceless Polynomial Time |
ALGORITHMICA
2004
13 years 7 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
ALGORITHMICA
2002
13 years 7 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
ARSCOM
2004
13 years 7 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
CAL
2002
13 years 7 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...