4171 search results - page 85 / 835 » Choice numbers of graphs |
138
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
166
click to vote
TACAS
1997
Springer
15 years 10 months ago
1997
Springer
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
158
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
190
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
177
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...