Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
For students
For employees
Statistics
Login
First page
>
Show document
Show document
Title:
Lattice embeddings of trees
Authors:
ID
Imrich, Wilfried
(Author)
ID
Kovše, Matjaž
(Author)
Files:
http://dx.doi.org/10.1016/j.ejc.2008.09.016
Language:
English
Work type:
Not categorized
Typology:
1.01 - Original Scientific Article
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Predstavljen je algoritem časovno linearne zahtevnosti, ki na izometričen način vloži dano drevo
T
v celoštevilsko mrežo najmanjše možne dimenzije in omogoča izračun mrežnih koordinat vozlišč drevesa
T
v optimalnem času.
Keywords:
matematika
,
teorija grafov
,
drevo
,
izometrična vložitev
,
mrežna vložitev
,
delna kocka
,
mathematics
,
graph theory
,
lattice embedding
,
isometric embedding
,
partial cube
,
tree
Year of publishing:
2009
Number of pages:
str. 1142-1148
Numbering:
Vol. 30, no. 5
PID:
20.500.12556/DKUM-51789
UDC:
519.173
ISSN on article:
0195-6698
COBISS.SI-ID:
15146841
NUK URN:
URN:SI:UM:DK:LGOXHCEE
Publication date in DKUM:
10.07.2015
Views:
1003
Downloads:
165
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
IMRICH, Wilfried and KOVŠE, Matjaž, 2009, Lattice embeddings of trees.
European journal of combinatorics
[online]. 2009. Vol. 30, no. 5, p. 1142–1148. [Accessed 28 March 2025]. Retrieved from: http://dx.doi.org/10.1016/j.ejc.2008.09.016
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Tree-like isometric subgraphs of hypercubes
Lattice embeddings of trees
Tribes of cubic partial cubes
Characterizing subgraphs of Hamming graphs
Larose, Benoit: Families of strongly projective graphs. - Discuss. Math. Graph Theory 22 (2002), no. 2, 271-292
Similar works from other repositories:
Isomorphism checking of I-graphs
t-tonska barvanja
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
European journal of combinatorics
Shortened title:
Eur. j. comb.
Publisher:
Academic Press
ISSN:
0195-6698
COBISS.SI-ID:
25427968
Secondary language
Language:
Unknown
Title:
Mrežne vložitve dreves
Abstract:
We present a linear algorithm that isometrically embeds a given tree
T
into an integer lattice of minimal dimension and allows one to compute the lattice coordinates of every single vertex of
T
in optimal time.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
