| S.Shpectorov, On scale-isometric embeddings of graphs into hypercubes, Europ. J.Combinatorics 14 (1993) 117--130. |
....a small distortion (of distances) used in computer architecture. 2) isometric (or isometric with a small distortion) embeddings of graphs into other (than l 1 spaces) normed spaces; see [LLR95] and the huge bibliography there. The following criterion for a graph G to be an l 1 graph is known, [Shp93], DeGr93] G is an l 1 graph iff it is an isometric subgraph of the direct product of half cubes and Cocktail Party graphs Km Theta2 (1 skeleton of the cross polytope fi m ) Even, a good polynomial algorithm for a recognition of l 1 graphs is known [DeSp96] So the raisons d etre for this ....
S.Shpectorov, On scale-isometric embeddings of graphs into hypercubes, Europ. J.Combinatorics 14 (1993) 117--130.
....a small distortion (of distances) used in computer architecture. 2) isometric (or isometric with a small distortion) embeddings of graphs into other (than l 1 spaces) normed spaces; see [LLR95] and the huge bibliography there. The following criterion for a graph G to be an l 1 graph is known, [Shp93], DeGr93] G is an l 1 graph iff it is an isometric subgraph of the direct product of half cubes and Cocktail Party graphs Km Theta2 (1 skeleton of the cross polytope fi m ) Even, a good polynomial algorithm for a recognition of l 1 graphs is known [DeSp96] So raisons d etre for this paper ....
S.Shpectorov, On scale-isometric embeddings of graphs into hypercubes, Europ. J.Combinatorics 14 (1993) 117--130.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC