Self-stabilizing algorithms for efficient sets of graphs and trees

DOI10.1016/J.IPL.2013.07.008MaRDI QIDQ2445247zbMATH OpenOpenAlexFDO

Authors Volker Turau

Publication date 14 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.07.008

zbMATH Keywords

efficient dominationgraph algorithmsself-stabilizing algorithms

Mathematics Subject Classification ID

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

Cites work

• A self-stabilizing algorithm for optimally efficient sets in graphs
• Efficient sets in graphs
• Efficient transformation of distance-2 self-stabilizing algorithms
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)

Cited in

(8)

• Self-stabilizing depth-first search
• SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
• Self-Stabilizing Domination Algorithms
• A self-stabilizing algorithm for the st-order problem
• scientific article; zbMATH DE number 2061546 (Why is no real title available?)
• A self-stabilizing algorithm for optimally efficient sets in graphs
• A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
• Self-stabilizing metric graphs

This page was built for publication: Self-stabilizing algorithms for efficient sets of graphs and trees

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