Pages that link to "Item:Q712488"
From MaRDI portal
The following pages link to Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488):
Displaying 9 items.
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata (Q975050) (← links)
- Link prediction based on temporal similarity metrics using continuous action set learning automata (Q1619759) (← links)
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks (Q2150397) (← links)
- A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search (Q2293151) (← links)
- Dominating problems in swapped networks (Q2629991) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem (Q2856008) (← links)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) (← links)
