Sciweavers

73 search results - page 7 / 15
» Graph drawing using quantum commute time
Sort
View
GD
2003
Springer
14 years 17 days ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
ER
2005
Springer
200views Database» more  ER 2005»
14 years 26 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
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
APBC
2004
13 years 8 months ago
Representing Experimental Biological Data in Metabolic Networks
This paper describes a novel approach to representing experimental biological data in metabolic networks. The aim is to allow biologists to visualise and analyse the data in the c...
Tim Dwyer, Hardy Rolletschek, Falk Schreiber
GD
2006
Springer
13 years 11 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis