Title of article
Recognizing halved cubes in a constant time per edge
Author/Authors
Imrich، نويسنده , , Wilfried and Klav?ar، نويسنده , , Sandi and Vesel، نويسنده , , Aleksander، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
5
From page
617
To page
621
Abstract
Graphs that can be isometrically embedded into the metric space l1 are called l1-graphs. Halved cubes play an important role in the characterization of l1-graphs. We present an algorithm that recognizes halved cubes in O(n log2 n) time.
Journal title
European Journal of Combinatorics
Serial Year
1995
Journal title
European Journal of Combinatorics
Record number
1549252
Link To Document