AbstractIn this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph anddGthe usual path metric ofG. By a hypercube we mean the edge graphHqof theq-dimensional binary cube. The path metricdHofHqis simply the Hamming distance
In this paper, we survey the metric properties of isometric subgraphs of hypercubes and, more genera...
Summary. A graph G is called generically minimally rigid in Rd if, for any choice of sufficiently ge...
We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph...
AbstractIn this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph andd...
AbstractIn this note we present some properties of L1-embeddable planar graphs. We present a charact...
In this note we present some properties of L1-embeddable planar garphs. We show that every such grap...
AbstractWe fill in the details of the algorithm sketched in [6] and determine its complexity. As a p...
AbstractWe investigate graphs that are isometrically embeddable into the metric space l1
AbstractWe investigate graphs that are isometrically embeddable into the metric space l1
The size sz(T) of an l1-graph T = (V, E) is the minimum of nf/tf over all the possible l1-embeddings...
The size sz(G) of an l_1-graph G=(V,E) is the minimum of n_f/t_f over all its possible l_1-embedding...
AbstractGraphs that can be isometrically embedded into the metric space l1 are called l1-graphs. Hal...
A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between t...
This Ph.D. manuscript is built around the notion of graph embedding. An embedding of a graph G is an...
This Ph.D. manuscript is built around the notion of graph embedding. An embedding of a graph G is an...
In this paper, we survey the metric properties of isometric subgraphs of hypercubes and, more genera...
Summary. A graph G is called generically minimally rigid in Rd if, for any choice of sufficiently ge...
We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph...
AbstractIn this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph andd...
AbstractIn this note we present some properties of L1-embeddable planar graphs. We present a charact...
In this note we present some properties of L1-embeddable planar garphs. We show that every such grap...
AbstractWe fill in the details of the algorithm sketched in [6] and determine its complexity. As a p...
AbstractWe investigate graphs that are isometrically embeddable into the metric space l1
AbstractWe investigate graphs that are isometrically embeddable into the metric space l1
The size sz(T) of an l1-graph T = (V, E) is the minimum of nf/tf over all the possible l1-embeddings...
The size sz(G) of an l_1-graph G=(V,E) is the minimum of n_f/t_f over all its possible l_1-embedding...
AbstractGraphs that can be isometrically embedded into the metric space l1 are called l1-graphs. Hal...
A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between t...
This Ph.D. manuscript is built around the notion of graph embedding. An embedding of a graph G is an...
This Ph.D. manuscript is built around the notion of graph embedding. An embedding of a graph G is an...
In this paper, we survey the metric properties of isometric subgraphs of hypercubes and, more genera...
Summary. A graph G is called generically minimally rigid in Rd if, for any choice of sufficiently ge...
We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph...
DOI
Add to ORKG