Sciweavers

942 search results - page 32 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
COCOON
1999
Springer
14 years 29 days 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
GD
2003
Springer
14 years 1 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
GD
2008
Springer
13 years 9 months ago
Graph Simultaneous Embedding Tool, GraphSET
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
COCOA
2010
Springer
13 years 6 months ago
Listing Triconnected Rooted Plane Graphs
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...
Bingbing Zhuang, Hiroshi Nagamochi
CJ
2008
110views more  CJ 2008»
13 years 8 months ago
Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
Keqin Li