852 search results - page 50 / 171 » Using graph parsing for automatic graph drawing |
125
click to vote
COCOA
2007
Springer
15 years 8 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
131
Voted
APWEB
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
102
click to vote
IFIPTCS
2010
15 years 12 days ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
102
click to vote
EMNLP
2006
15 years 3 months ago
2006
Information Extraction (IE) is the task of extracting knowledge from unstructured text. We present a novel unsupervised approach for information extraction based on graph mutual r...
109
click to vote
TCAD
2008
15 years 2 months ago
2008
The verification of a system-on-chip is challenging due to its high level of integration. Multiple components in a system can behave concurrently and compete for resources. Hence, ...