Sciweavers

52 search results - page 6 / 11
» Crossing minimization in extended level drawings of graphs
Sort
View
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 10 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
INFOVIS
1999
IEEE
14 years 22 days ago
Constellation: A Visualization Tool for Linguistic Queries from MindNet
ct Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creato...
Tamara Munzner, François Guimbretièr...
APVIS
2007
13 years 10 months ago
Using eye tracking to investigate graph layout effects
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has b...
Weidong Huang
VDA
2010
247views Visualization» more  VDA 2010»
13 years 10 months ago
Flow Web: a graph based user interface for 3D flow field exploration
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
Lijie Xu, Han-Wei Shen
FOCS
2009
IEEE
14 years 3 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi