718 search results - page 103 / 144 » Coloring quasi-line graphs |
135
click to vote
ARSCOM
2004
15 years 1 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
125
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
129
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
111
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
125
click to vote
GLOBECOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...