1105 search results - page 62 / 221 » Linear choosability of graphs |
138
click to vote
IPL
2000
15 years 3 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
138
click to vote
TIT
2011
14 years 11 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
148
click to vote
BPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
145
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...