Sciweavers

514 search results - page 69 / 103
» Drawing a Graph in a Hypercube
Sort
View
68
Voted
CVIU
2008
113views more  CVIU 2008»
14 years 9 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
GD
1998
Springer
15 years 1 months ago
Improved Force-Directed Layouts
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
Emden R. Gansner, Stephen C. North
CATS
2008
14 years 11 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
GD
2005
Springer
15 years 3 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood
86
Voted
GD
1999
Springer
15 years 1 months ago
Isomorphic Subgraphs
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
Sabine Bachl