Sciweavers

34 search results - page 4 / 7
» jgaa 2006
Sort
View
JGAA
2006
108views more  JGAA 2006»
13 years 7 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
JGAA
2006
75views more  JGAA 2006»
13 years 7 months ago
Upward Planar Drawings and Switch-regularity Heuristics
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
Walter Didimo
JGAA
2006
69views more  JGAA 2006»
13 years 7 months ago
Efficient drawing of RNA secondary structure
In this paper, we propose a new layout algorithm that draws the secondary structure of a Ribonucleic Acid (RNA) automatically according to some of the biologists' aesthetic c...
David Auber, Maylis Delest, Jean-Philippe Domenger...
JGAA
2006
72views more  JGAA 2006»
13 years 7 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt
JGAA
2006
85views more  JGAA 2006»
13 years 7 months ago
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
Grant A. Cheston, Tjoen Seng Jap