3267 search results - page 108 / 654 » Generalized quasirandom graphs |
CSR
2009
Springer
15 years 5 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
ICANN
2007
Springer
15 years 5 months ago
2007
Springer
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...
VL
2003
IEEE
15 years 4 months ago
2003
IEEE
Thispaper presents an approach to spatial specifications for Web information transformation'. Extended from the Reserved Graph Grammar (RGG), a Spatial Graph Grammar (SGG) is...
GD
2006
Springer
15 years 2 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
CCCG
2007
15 years 20 days ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....