Sciweavers

1321 search results - page 71 / 265
» Quadratic forms on graphs
Sort
View
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 3 months ago
Hybrid real-coded mutation for genetic algorithms applied to graph layouts
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...
Dana Vrajitoru, Jason DeBoni
ASP
2003
Springer
15 years 3 months ago
Graphs and colorings for answer set programming: Abridged Report
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
Kathrin Konczak, Torsten Schaub, Thomas Linke
APVIS
2007
14 years 11 months ago
Level-of-detail visualization of clustered graph layouts
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
Michael Balzer, Oliver Deussen
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 10 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
DM
2010
107views more  DM 2010»
14 years 10 months ago
Degree-associated reconstruction number of graphs
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...
Michael D. Barrus, Douglas B. West