Sciweavers

684 search results - page 8 / 137
» On embedding well-separable graphs
Sort
View
IPPS
1998
IEEE
15 years 1 months ago
Emulating Direct Products by Index-Shuffle Graphs
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
Bojana Obrenic
43
Voted
DM
2007
59views more  DM 2007»
14 years 9 months ago
Non-existence of nonorientable regular embeddings of n-dimensional cubes
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
Young Soo Kwon, Roman Nedela
ECCV
2004
Springer
15 years 11 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
14 years 11 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
COMPGEOM
2007
ACM
15 years 1 months ago
Probabilistic embeddings of bounded genus graphs into planar graphs
Piotr Indyk, Anastasios Sidiropoulos