785 search results - page 14 / 157 » Embedding a Forest in a Graph |
ARSCOM
2005
13 years 7 months ago
2005
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
GD
1999
Springer
14 years 1 days ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
CCCG
2007
13 years 9 months 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....
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...