Sciweavers

3396 search results - page 9 / 680
» Tree representations of graphs
Sort
View
CEC
2007
IEEE
14 years 3 months ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers
CCCG
1998
13 years 10 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
TALG
2008
69views more  TALG 2008»
13 years 8 months ago
Testing Euclidean minimum spanning trees in the plane
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
Artur Czumaj, Christian Sohler
KES
2004
Springer
14 years 2 months ago
Content-Based Image Retrieval Using Multiple Representations
Many different approaches for content-based image retrieval have been proposed in the literature. Successful approaches consider not only simple features like color, but also take ...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
UAI
2001
13 years 10 months ago
Graphical Models for Game Theory
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
Michael J. Kearns, Michael L. Littman, Satinder P....