Sciweavers

431 search results - page 70 / 87
» Bold Graph Drawings
Sort
View
CGF
2008
110views more  CGF 2008»
13 years 7 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
GPEM
2007
95views more  GPEM 2007»
13 years 7 months ago
Where is evolutionary computation going? A temporal analysis of the EC community
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
Carlos Cotta, Juan Julián Merelo Guerv&oacu...
BMCBI
2007
134views more  BMCBI 2007»
13 years 7 months ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd
GD
2007
Springer
14 years 1 months ago
Constrained Simultaneous and Near-Simultaneous Embeddings
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
Fabrizio Frati, Michael Kaufmann, Stephen G. Kobou...
CLA
2004
13 years 8 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig