MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
From MaRDI portal
Publication:5696910
DOI10.1142/S012905410300173XzbMath1075.68624MaRDI QIDQ5696910
Ophir Frieder, Khaled M. Alzoubi, Peng-Jun Wan
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
ad hoc networksconnected dominating setmaximal independent setsparse spannerweakly-connected dominating set
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
The weakly connected independent set polytope in corona and join of graphs ⋮ Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs ⋮ Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory ⋮ Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler ⋮ The second largest number of maximal independent sets in connected graphs with at most one cycle ⋮ Distributed approximation of capacitated dominating sets ⋮ Constructing weakly connected dominating set for secure clustering in distributed sensor network ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks ⋮ Clustering the wireless ad hoc networks: a distributed learning automata approach ⋮ Local solutions for global problems in wireless networks ⋮ The minimum weakly connected independent set problem: polyhedral results and branch-and-cut ⋮ Finding minimum weight connected dominating set in stochastic graph based on learning automata ⋮ A self-stabilizing algorithm for constructing weakly connected minimal dominating sets ⋮ LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS ⋮ Construction of strongly connected dominating sets in asymmetric multihop wireless networks ⋮ A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks ⋮ On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
Cites Work
This page was built for publication: MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
