134 search results - page 2 / 27 » An Heuristic for the Construction of Intersection Graphs |
CEC
2009
IEEE
13 years 9 months ago
2009
IEEE
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
ISCIS
2009
Springer
13 years 11 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
COMBINATORICS
2004
13 years 4 months ago
2004
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...