Sciweavers

712 search results - page 64 / 143
» On Spectral Graph Drawing
Sort
View
ER
2005
Springer
200views Database» more  ER 2005»
14 years 2 months 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
ICPP
1995
IEEE
14 years 11 days ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
GD
2004
Springer
14 years 2 months ago
GraphML Transformation
The efforts put into XML-related technologies have exciting consequences for XML-based graph data formats such as GraphML. We here give a systematic overview of the possibilities ...
Ulrik Brandes, Christian Pich
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 5 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
ICPR
2010
IEEE
14 years 3 months ago
A Graph Matching Algorithm using Data-Driven Markov Chain Monte Carlo Sampling
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
Jungmin Lee, Minsu Cho, Kyoung Mu Lee