Find link

language:

Find link is a tool written by Edward Betts.

searching for Maximal independent set 12 found (32 total)

Basis of a matroid (1,639 words) [view diff] exact match in snippet view article find links to article

In mathematics, a basis of a matroid is a maximal independent set of the matroid—that is, an independent set that is not contained in any other independent

Multi-trials technique (218 words) [view diff] exact match in snippet view article find links to article

Distributed Computing Schneider, J. (2008), "A log-star distributed maximal independent set algorithm for growth-bounded graphs" (PDF), Proceedings of the

Matroid partitioning (2,048 words) [view diff] exact match in snippet view article find links to article

{\displaystyle D} . Each set in the current partition must be a maximal independent set in the restriction M | S {\displaystyle M|S} , for if some element

APX (997 words) [view diff] exact match in snippet view article find links to article

max degree is fixed). Min vertex cover. The complement of any maximal independent set must be a vertex cover. Min dominating set in bounded-degree graphs

Matroid (8,774 words) [view diff] exact match in snippet view article find links to article

{\displaystyle E} that is not independent is called dependent. A maximal independent set – that is, an independent set that becomes dependent upon adding

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

set and C is a maximum clique. C is a maximal clique and i is a maximal independent set. In this case, G has a unique partition (C, i) into a clique and

Metric k-center (3,613 words) [view diff] exact match in snippet view article find links to article

at most k and computes a maximal independent set of Gi, looking for the smallest index i that has a maximal independent set with a size of at least k

Dedekind eta function (3,057 words) [view diff] exact match in snippet view article find links to article

known as Sturm's bound). Then use linear algebra to determine a maximal independent set among these eta quotients. Assuming that we have not already found

Scale-free network (6,013 words) [view diff] case mismatch in snippet view article find links to article

S2CID 45651735. Heydari, H.; Taheri, S.M.; Kaveh, K. (2018). "Distributed Maximal Independent Set on Scale-Free Networks". arXiv:1804.02513 [cs.DC]. Clauset, Aaron;

Small-bias sample space (2,439 words) [view diff] exact match in snippet view article find links to article

(1986), "A fast and simple randomized parallel algorithm for the maximal independent set problem" (PDF), Journal of Algorithms, 7 (4): 567–583, doi:10

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

are the complements of the well-covered graphs, in which every maximal independent set is maximum. However, other graphs have maximal cliques that are

Incidence coloring (3,817 words) [view diff] exact match in snippet view article find links to article

independent set of arcs in D(G) is a star forest. Therefore, a maximal independent set of arcs is a maximal star forest. This implies that at least 2