3204 search results - page 258 / 641 » The Alcuin Number of a Graph |
155
click to vote
JCT
2008
15 years 6 months ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
218
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
193
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
186
click to vote
SPAA
2006
ACM
16 years 18 days ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
196
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...