Sciweavers

515 search results - page 48 / 103
» Layouts of Expander Graphs
Sort
View
MP
1998
117views more  MP 1998»
13 years 10 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
DIAL
2006
IEEE
103views Image Analysis» more  DIAL 2006»
14 years 4 months ago
Multi-Queue Merging Scheme And Its Application in Arabic Script Segmentation
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
Pingping Xiu, Liangrui Peng, Xiaoqing Ding
INFOVIS
1999
IEEE
14 years 3 months ago
Constellation: A Visualization Tool for Linguistic Queries from MindNet
ct Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creato...
Tamara Munzner, François Guimbretièr...
CGF
2008
110views more  CGF 2008»
13 years 11 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
GD
2007
Springer
14 years 5 months ago
Drawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
Lev Nachmanson, George G. Robertson, Bongshin Lee