MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Geometrical embeddings of graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

14 documents found, showing 1 through 10. Next 10 →

ATOM

Expander Flows, Geometric Embeddings and Graph Partitioning
by Sanjeev Arora, Satish Rao, Umesh Vazirani — 2004 — IN 36TH ANNUAL SYMPOSIUM ON THE THEORY OF COMPUTING
…Expander Flows, Geometric Embeddings and Graph Partitioning Sanjeev Arora ∗ Satish Rao † Umesh…
Cited by 117 (15 self) – Add To MetaCart

Simultaneous Geometric Graph Embeddings
by Ro Estrella-balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
…Simultaneous Geometric Graph Embeddings Alejandro Estrella-Balderrama 1 , Elisabeth Gassner 3…
Cited by 2 (2 self) – Add To MetaCart

A lower bound of 8/(7 + 1/(k-1)) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut
by Ari Freund, Howard Karloff — 2000
… embedding of the graph’s vertices into Rk . We present a lower bound of 8/(7 + 1 k−1 ) on the integrality…
Cited by 1 (0 self) – Add To MetaCart

A Taxonomy of Divide-and-Conquer Approximation Algorithms
by Yuval Rabani, R. Ravi, A. Agrawal, G. Even, J. Naor, P. Klein, S. Plotkin, S. Plotkin, S. Rao, S. Rao — 1995
… algorithms for geometric embeddings in the plane with applications to parallel processing problems. In Proc…
Add To MetaCart

Directional
by Routing Viagenerals St-Numberings, Fred S. Annexstein, Kenneth, A. Berman — 2000 — SIAM Journal on Discrete Mathematics
… previouswork. The concept of graph st-numberings has been generalized to geometric embedding of graphs…
Add To MetaCart

Structural descriptors for 3d shapes
by Michela Spagnuolo, Silvia Biasotti, Bianca Falcidieno, Simone Marini — 2006 — Content-Based Retrieval, number 06171 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl
…, it is not yet necessary that the geometric embedding of the graph is intuitive. Therefore, the same framework…
Cited by 1 (0 self) – Add To MetaCart

Spectral Partitioning Works: Planar graphs and finite element meshes
by Daniel A. Spielman, Shang-Hua Teng — 1996 — In IEEE Symposium on Foundations of Computer Science
… the quality of geometric embeddings of a graph with its Fiedler value. We then show (using the main result…
Cited by 106 (4 self) – Add To MetaCart

Graph Partitioning Algorithms With Applications To Scientific Computing
by Alex Pothen — 1997 — Parallel Numerical Algorithms
…. The algorithm also requires a geometric embedding of the graph. 4 The spectral partitioning algorithm…
Cited by 32 (0 self) – Add To MetaCart

Latent semantic analysis and Fiedler retrieval. Submitted for publication to
by Bruce Hendrickson — 2006 — Earlier version in Proc. SIAM Workshop on Text Mining’06
… vertices are close to each other (i.e., edge lengths will be short). Geometric embeddings of graphs can…
Cited by 2 (1 self) – Add To MetaCart

Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time
by Jittat Fakcharoenphol, Satish Rao — 2001 — In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science
… graph that must obey a non-crossing property in the geometric embedding of the graph inherited from…
Cited by 31 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB