20.500.12556/RUL-139679 A linear time algorithm for weighted k-fair domination problem in cactus graphs 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. linear algorithms cactus graphs DFS structure weighted k-fair domination linearni algoritmi kaktus grafi DFS strukture neodvisna dominacija teorija grafov true false true Angleški jezik Slovenski jezik Članek v reviji 2022-09-06 09:49:42 2022-09-06 09:49:44 2022-09-16 04:11:37 0000-00-00 00:00:00 2022 0 0 22 str. iss. 3, art. 46 Vol. 3 Sep. 2022 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2022-09-02 519.17 2662-2556 10.1007/s43069-022-00154-8 120314883  Novak,_Zerovnik-A_linear_time_algorithm_for_weighted_k-fair_domination_problem_in_cactus_graphs.pdf  Novak,_Zerovnik-A_linear_time_algorithm_for_weighted_k-fair_domination_problem_in_cactus_graphs.pdf 1 20879A09D123FF007264279B64E90FBF 857eecdcfc3fec457476c5577ea709183c0e164ef1ba62b6c0398e826d70ac90 21ef7d7f-2db9-11ed-92af-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=160277 https://link.springer.com/article/10.1007/s43069-022-00154-8 1 6cc07632-2db8-11ed-92af-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=160273 Fakulteta za strojništvo 0 0 0