121 search results - page 3 / 25 » Visibility Representations of Complete Graphs |
GD
2008
Springer
14 years 10 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
ADAEUROPE
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
RT
1999
Springer
15 years 1 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
72
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...