Sciweavers

1163 search results - page 78 / 233
» Embedding into Bipartite Graphs
Sort
View
DM
2007
103views more  DM 2007»
13 years 8 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 8 months ago
C-K-R Partitions of Sparse Graphs
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
Manor Mendel, Chaya Schwob
DCG
2010
135views more  DCG 2010»
13 years 8 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
CVPR
2009
IEEE
15 years 3 months ago
Multiplicative Nonnegative Graph Embedding
In this paper, we study the problem of nonnegative graph embedding, originally investigated in [14] for reaping the benefits from both nonnegative data factorization and the spe...
Changhu Wang (University of Science and Technology...
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
13 years 9 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman