Sciweavers

59 search results - page 8 / 12
» FADE: Graph Drawing, Clustering, and Visual Abstraction
Sort
View
VL
2009
IEEE
187views Visual Languages» more  VL 2009»
14 years 2 months ago
Changing euler diagram properties by edge transformation of euler dual graphs
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...
John Howse, Peter Rodgers, Gem Stapleton
ER
2005
Springer
200views Database» more  ER 2005»
14 years 28 days ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
VIZSEC
2005
Springer
14 years 26 days ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...
GBRPR
2007
Springer
13 years 11 months ago
Constellations and the Unsupervised Learning of Graphs
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
GD
2008
Springer
13 years 8 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...