Sciweavers

605 search results - page 49 / 121
» Constrained Graph Layout
Sort
View
VLC
2002
93views more  VLC 2002»
13 years 9 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase
IWPEC
2004
Springer
14 years 3 months ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
IV
2003
IEEE
116views Visualization» more  IV 2003»
14 years 3 months ago
Visualization of Semantic Metadata and Ontologies
Implicit information embedded in semantic web graphs, such as topography, clusters, and disconnected subgraphs is difficult to extract from text files. Visualizations of the graph...
Paul Mutton, Jennifer Golbeck
MFCS
2007
Springer
14 years 4 months ago
Exact Algorithms for L (2, 1)-Labeling of Graphs
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
Jan Kratochvíl, Dieter Kratsch, Mathieu Lie...
ICPR
2002
IEEE
14 years 11 months ago
Spatial Color Component Matching of Images
Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a chal...
Jianying Hu, Efstathios Hadjidemetriou