A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs

DOI10.1007/s43069-022-00154-8zbMath1495.05320OpenAlexW4294237777WikidataQ113890379 ScholiaQ113890379MaRDI QIDQ2079283

Tina Novak, Janez Žerovnik

Publication date: 29 September 2022

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-022-00154-8

zbMATH Keywords

cactus graphlinear algorithmDFS structureweighted \(k\)-fair domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fair domination in graphs
• Broadcasting on cactus graphs
• A linear algorithm for the domination number of a tree
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• The obnoxious center problem on weighted cactus graphs.
• On the \(k\)-domination number of digraphs
• A new lower bound on the domination number of a graph
• Distance distributions for graphs modeling computer networks
• WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS
• The Hosoya polynomial of double weighted graphs
• Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis

This page was built for publication: A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs