Computing median and antimedian sets in median graphs
Balakrishnan, Kannan ...
Mediana (antimediana) profila ▫$\pi = (u_1,...,u_k)$▫ vozlišč grafa ▫$G$▫ je množica vozlišč ▫$x$▫, ki minimizirajo (maksimizirajo) oddaljenost ▫$\sum_i d(x,u_i)$▫. Oblikovana sta algoritma za ...medianske grafe ▫$G$▫ zahtevnosti ▫$O(n \; {\rm idim}(G))$▫, kjer je ▫$n$▫ red grafa in ▫${\rm idim}(G)$▫ izometrična dimenzija ▫$G$▫. Prvi algoritem izračuna medianske množice profilov in je v praksi pogosto hitrejši kot drugi algoritem. Slednji algoritem dodatno izračuna antimedianske množice ter funkcije oddaljenosti in deluje na poljubnih delnih kockah.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
