Sciweavers

1633 search results - page 112 / 327
» Planar Map Graphs
Sort
View
DCG
2011
13 years 5 months ago
Small Grid Embeddings of 3-Polytopes
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
Ares Ribó Mor, Günter Rote, Andr&eacut...
INFOCOM
2010
IEEE
13 years 8 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
DIAGRAMS
2008
Springer
14 years 2 days ago
Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs
Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs ...
Helen C. Purchase, Amanjit Samra
RSA
2010
94views more  RSA 2010»
13 years 8 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
EMNLP
2010
13 years 8 months ago
Mining Name Translations from Entity Graph Mapping
This paper studies the problem of mining entity translation, specifically, mining English and Chinese name pairs. Existing efforts can be categorized into (a) a transliterationbas...
Gae-won You, Seung-won Hwang, Young-In Song, Long ...