An algorithm for computing the obnoxious center on a weighted graph
Zmazek, Blaž ; Žerovnik, Janez, 1958-
Problem nezaželenih centrov v grafu predstavlja določitev takšne lokacije na povezavah grafa, da je njena minimalna razdalja do poljubne točke grafa kolikor se da velika. Uteži na točkah grafa lahko ...predstavljajo njihovo občutljivost, ki jo je moč oceniti z eno izmed konstantno mnogo vrednosti. Kadar je vsaki točki grafa prirejena ena izmed ▫$c$▫ različnih vrednosti (uteži) glede na njeno občutljivost, rešujemo tako imenovan problem nezaželenih centrov na grafu z ovrednotenimi točkami. V tem članku bomo predstavili algoritem, ki določi nezaželeni center na kaktusu z ovrednotenimi točkami v linearnem času
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.
