Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Connected dominating set (view), Edge dominating set (view), Eternal dominating set (view)

searching for Dominating set 15 found (72 total)

Smith set (2,322 words) [view diff] exact match in snippet view article find links to article

candidate outside the set is known as a dominating set. Thus the Smith set is also called the smallest dominating set. The Schwartz set is equivalent to the

Jie Wu (244 words) [view diff] exact match in snippet view article find links to article

in hypercube-based multiprocessors, local construction of connected dominating set and its applications in mobile ad hoc networks, and efficient routing

Rook's graph (3,777 words) [view diff] exact match in snippet view article find links to article

k-dominating set is a set of vertices whose corresponding squares attack all other squares (via a rook's move) at least k times. A k-tuple dominating set

Italo Jose Dejter (5,660 words) [view diff] exact match in snippet view article find links to article

formed by the vertices and 5-cycles of the Petersen graph. A perfect dominating set S of a graph G is a set of vertices of G such that every vertex of G

Ding-Zhu Du (887 words) [view diff] case mismatch in snippet view article find links to article

Combinatorial Group Testing and Its Applications (2nd Edition). Connected Dominating Set: Theory and Applications. Design and Analysis of Approximation Algorithms

Optimized Link State Routing Protocol (1,522 words) [view diff] case mismatch in snippet view article find links to article

2009). Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding. IETF. doi:10.17487/RFC5614. RFC 5614. Retrieved 22 October

Split graph (1,642 words) [view diff] case mismatch in snippet view article find links to article

are strongly chordal graphs. It is also well known that the Minimum Dominating Set problem remains NP-complete for split graphs. One remarkable property

Chordal bipartite graph (884 words) [view diff] case mismatch in snippet view article find links to article

Brandstädt, Andreas (1987), "The NP-completeness of Steiner Tree and Dominating Set for chordal bipartite graphs", Theoretical Computer Science, 53: 257–265

Perfect graph (7,055 words) [view diff] exact match in snippet view article find links to article

smallest dominating set (a set of vertices adjacent to all remaining vertices) equals the size of the smallest independent set that is a dominating set. These

Topology control (1,164 words) [view diff] case mismatch in snippet view article find links to article

Spanning Tree (Change in Tx Range) Reduced network topology via Connected Dominating Set (Select a subset of nodes that cover all the network and turn off non-selected

Cardinal characteristic of the continuum (1,573 words) [view diff] exact match in snippet view article find links to article

f:\omega \to \omega \,\exists g\in F(f\leq ^{*}g)\}).} Clearly any such dominating set F {\displaystyle F} is unbounded, so b {\displaystyle {\mathfrak {b}}}

PLS (complexity) (5,471 words) [view diff] no match in snippet view article

Min-Independent-Dominating-Set-B/k-Flip has been proven to be PLS-complete via a tight PLS-reduction from Min-4Sat-B′/Flip to Min-Independent-Dominating-Set-B/k-Flip

Kayhan Erciyeş (616 words) [view diff] case mismatch in snippet view article find links to article

Deniz Cokuslu) (2010) Topology Control for Mobile Ad hoc Networks: A Dominating Set Based Approach (with Deniz Cokuslu and Orhan Dagdeviren) (2010) Distributed

Clique problem (9,905 words) [view diff] exact match in snippet view article find links to article

Grandoni, F. (2004), "On the complexity of fixed parameter clique and dominating set", Theoretical Computer Science, 326 (1–3): 57–67, doi:10.1016/j.tcs

Dominance-based rough set approach (4,321 words) [view diff] exact match in snippet view article find links to article

} {\displaystyle D_{P}^{-}(x)=\{y\in U\colon xD_{p}y\}} represent P-dominating set and P-dominated set with respect to x ∈ U {\displaystyle x\in U} , respectively