684 search results - page 35 / 137 » On embedding well-separable graphs |
140
click to vote
SAC
2008
ACM
15 years 3 months ago
2008
ACM
The tree-based languages XQuery and XSLT for XML are widely supported. Many tools do not yet support the new RDF graph query language SPARQL. We propose to embed SPARQL subqueries...
148
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
132
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
136
click to vote
DM
2006
15 years 4 months ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
162
click to vote
DCG
2011
14 years 11 months ago
2011
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...