DOIAbstract
AbstractWe investigate graphs that are isometrically embeddable into the metric space l1
AbstractWe investigate graphs that are isometrically embeddable into the metric space l1
We consider the embedding of a finite metric space into a weighted graph in such a way that the tota...
AbstractWe define the t-uniform cube-hypergraphs of dimension n, Q(n,t), and give two characterizati...
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
In this paper, we survey the metric properties of isometric subgraphs of hypercubes and, more genera...
AbstractIn this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph andd...
In many contexts, it is useful to determine if a particular distance metric can be broken down into ...
In this note we present some properties of L1-embeddable planar garphs. We show that every such grap...
AbstractIn this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph andd...
A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between t...
AbstractA metric d is h-embeddable if it can be isometrically embedded in some hypercube. Equivalent...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
AbstractIn this note we present some properties of L1-embeddable planar graphs. We present a charact...
We consider the embedding of a finite metric space into a weighted graph in such a way that the tota...
AbstractWe define the t-uniform cube-hypergraphs of dimension n, Q(n,t), and give two characterizati...
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
In this paper, we survey the metric properties of isometric subgraphs of hypercubes and, more genera...
AbstractIn this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph andd...
In many contexts, it is useful to determine if a particular distance metric can be broken down into ...
In this note we present some properties of L1-embeddable planar garphs. We show that every such grap...
AbstractIn this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph andd...
A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between t...
AbstractA metric d is h-embeddable if it can be isometrically embedded in some hypercube. Equivalent...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
AbstractIn this note we present some properties of L1-embeddable planar graphs. We present a charact...
We consider the embedding of a finite metric space into a weighted graph in such a way that the tota...
AbstractWe define the t-uniform cube-hypergraphs of dimension n, Q(n,t), and give two characterizati...
AbstractWe fill in the details of the algorithm sketched in [6] and determine its complexity. As a p...
Add to ORKG