2503 search results - page 118 / 501 » A study of 3-arc graphs |
135
Voted
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
172
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
148
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
158
Voted
GD
2004
Springer
15 years 11 months ago
2004
Springer
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
167
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...