VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • A linear time algorithm for weighted k-fair domination problem in cactus graphs [Elektronski vir]
    Novak, Tina, 1977- ; Žerovnik, Janez, 1958-
    A set D of vertices in a graph G is a k-fair dominating set if every vertex not in D is adjacent to exactly k vertices in D. The weighted k-fair domination number ▫$wfd_k(G)$▫ of a vertex-weighted ... graph G is the minimum weight w(D) among all k-fair dominating sets D. In addition to the weighted k-fair domination number, some auxiliary parameters are defined. It is shown that for a cactus graph, the weighted k-fair domination number and auxiliary parameters can be calculated in linear time.
    Vir: Operations research forum [Elektronski vir]. - ISSN 2662-2556 (Vol. 3, iss. 3, Sep. 2022, str. 1-29)
    Vrsta gradiva - e-članek
    Leto - 2022
    Jezik - angleški
    COBISS.SI-ID - 120314883

    Povezava(-e):

    https://link.springer.com/article/10.1007/s43069-022-00154-8
    Repozitorij Univerze v Ljubljani – RUL
    DOI

Vnos na polico