718 search results - page 102 / 144 » Coloring quasi-line graphs |
106
click to vote
APVIS
2008
15 years 3 months ago
2008
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks...
103
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
102
click to vote
CC
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
143
click to vote
ASP
2005
Springer
15 years 7 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
102
click to vote
DAGSTUHL
2008
15 years 3 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...