Sciweavers

92 search results - page 9 / 19
» Applications of Parameterized st-Orientations in Graph Drawi...
Sort
View
CHI
2010
ACM
14 years 2 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
COCOON
1999
Springer
13 years 11 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
MMAS
2010
Springer
13 years 2 months ago
A Fast Multigrid Algorithm for Energy Minimization under Planar Density Constraints
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...
Dorit Ron, Ilya Safro, Achi Brandt
JCO
2010
101views more  JCO 2010»
13 years 6 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 5 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...