Sciweavers

712 search results - page 15 / 143
» On Spectral Graph Drawing
Sort
View
HCI
2007
13 years 9 months ago
Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipar...
Kazuo Misue
GD
2003
Springer
14 years 21 days ago
Selected Open Problems in Graph Drawing
Abstract. In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research i...
Franz-Josef Brandenburg, David Eppstein, Michael T...
PAMI
2006
137views more  PAMI 2006»
13 years 7 months ago
Isoperimetric Graph Partitioning for Image Segmentation
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...
Leo Grady, Eric L. Schwartz
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 7 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 7 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu