| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 826 4 |
| Ultima descărcare din IBN: 2017-04-28 10:23 |
| Căutarea după subiecte similare conform CZU |
| 515.142.21+519.179.1 (1) |
| Топология (44) |
| Комбинаторный анализ. Теория графов (115) |
 SM ISO690:2012CATARANCIUC, Sergiu, SOLTAN, Petru. Complex of abstract cubes and median problem. In: Computer Science Journal of Moldova, 2011, nr. 1(55), pp. 38-63. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(55) / 2011 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 515.142.21+519.179.1 | ||||||
| Pag. 38-63 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In this paper a special complex K of abstract cubes [2, 3],
which contains only n-dimensional cubes is examined. The border of this complex is an abstract (n - 1)-dimensional sphere.
It is proved that the abstract sphere contains at least one 0-
dimensional cube, which belongs to exactly n cubes with dimension 1, if the complex is a homogeneous n-dimensional tree. This
result allows to solve, in an efficient way, the problem of median
for a skeleton of size 1 of the tree with weighted vertices and
edges. The algorithm to calculate the median without using any
metric is described. The proposed algorithm can be applied with
some modifications, for arbitrary complex of abstract cubes.
Mathematics subject classification: 18F15, 32Q60, 68R10 |
||||||
| Cuvinte-cheie Abstract cube, multidimensional homogeneous tree, abstract sphere, complex, median |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Cataranciuc, S.G.</dc:creator> <dc:creator>Soltan, P.</dc:creator> <dc:date>2011-01-05</dc:date> <dc:description xml:lang='en'>In this paper a special complex K of abstract cubes [2, 3], which contains only n-dimensional cubes is examined. The border of this complex is an abstract (n - 1)-dimensional sphere. It is proved that the abstract sphere contains at least one 0- dimensional cube, which belongs to exactly n cubes with dimension 1, if the complex is a homogeneous n-dimensional tree. This result allows to solve, in an efficient way, the problem of median for a skeleton of size 1 of the tree with weighted vertices and edges. The algorithm to calculate the median without using any metric is described. The proposed algorithm can be applied with some modifications, for arbitrary complex of abstract cubes. Mathematics subject classification: 18F15, 32Q60, 68R10</dc:description> <dc:source>Computer Science Journal of Moldova 55 (1) 38-63</dc:source> <dc:subject>Abstract cube</dc:subject> <dc:subject>complex</dc:subject> <dc:subject>multidimensional homogeneous tree</dc:subject> <dc:subject>abstract sphere</dc:subject> <dc:subject>median</dc:subject> <dc:title>Complex of abstract cubes and median problem</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
