Sciweavers

JGAA
2006
85views more  JGAA 2006»
13 years 11 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
JGAA
2006
108views more  JGAA 2006»
13 years 11 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
100views more  JGAA 2006»
13 years 11 months ago
Orthogonal Hypergraph Drawing for Improved Visibility
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
Thomas Eschbach, Wolfgang Günther, Bernd Beck...
JGAA
2006
72views more  JGAA 2006»
13 years 11 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
120views more  JGAA 2006»
13 years 11 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
JGAA
2006
127views more  JGAA 2006»
13 years 11 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
JGAA
2006
83views more  JGAA 2006»
13 years 11 months ago
On the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
Marc Demange, Tinaz Ekim, Dominique de Werra
JGAA
2006
69views more  JGAA 2006»
13 years 11 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
75views more  JGAA 2006»
13 years 11 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
63views more  JGAA 2006»
13 years 11 months ago
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
Reuven Bar-Yehuda, Irad Yavneh