Autonomous domination

MaRDI QIDQ6913079zbMATH OpenFDO

Authors Peter Ulrickson

Publication date 21 October 2025

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/92/ajc_v92_p210.pdf

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A distributed algorithm for minimum distance-k domination in trees
• A distributed algorithm to find \(k\)-dominating sets
• A linear algorithm for the domination number of a tree
• A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
• Algorithmic results in secure total dominating sets on graphs
• Defending the Roman Empire---a new strategy
• Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
• Distributed distance domination in graphs with no \(K_{2,t}\)-minor
• Distributed domination on sparse graph classes
• Dominating sets in n‐cubes
• Dynamic dominating sets: the eviction model for eternal domination
• Fast Distributed Construction of Smallk-Dominating Sets and Applications
• Foolproof eternal domination in the all-guards move model
• scientific article; zbMATH DE number 5575574 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• scientific article; zbMATH DE number 2104838 (Why is no real title available?)
• scientific article; zbMATH DE number 2114685 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• Linear algorithms on recursive representations of trees
• Locality in Distributed Graph Algorithms
• Perfect secure domination in graphs
• Protecting a graph with mobile guards
• Reducibility among combinatorial problems
• Roman domination in graphs.
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Self-stabilizing systems in spite of distributed control
• The local detection paradigm and its applications to self-stabilization
• Tight bounds for eternal dominating sets in graphs

This page was built for publication: Autonomous domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913079)