24 search results - page 3 / 5 » Graph Drawing by Stress Majorization |
GD
1997
Springer
13 years 11 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
EJC
2007
13 years 7 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
IV
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents the results of an analysis and visualization of 428,440 movies from the Internet Movie Database (IMDb) provided for the Graph Drawing 2005 contest. Simple stat...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...