Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Maximal set

Known as: Maximal, Maximal sets 
In recursion theory, the mathematical theory of computability, a maximal set is a coinfinite recursively enumerable subset A of the natural numbers… Expand
Wikipedia

Related topics

Related topics

4 relations
Anaphora (linguistics)Recursively enumerable setSimple set

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
You Only Propagate Once: Painless Adversarial Training Using Maximal Principle
Deep learning achieves state-of-the-art results in many areas. However recent works have shown that deep networks can be… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Review
2018
Review
2018
Raincloud plots: a multi-platform tool for robust data visualization
Across scientific disciplines, there is a rapidly growing recognition of the need for more statistically robust, transparent… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1998
Highly Cited
1998
A simple transmit diversity technique for wireless communications
  • S. Alamouti
  • IEEE J. Sel. Areas Commun.
  • 1998
    • Corpus ID: 3236236
This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme… Expand
  • figure 2
  • figure 1
  • table I
  • figure 3
  • table III
Highly Cited
1988
Highly Cited
1988
On Generating All Maximal Independent Sets
Abstract We present an algorithm that generates all maximal independent sets of a graph in lexicographic order, with only… Expand
Highly Cited
1986
Highly Cited
1986
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is… Expand
Highly Cited
1986
Highly Cited
1986
A Simple Parallel Algorithm for the Maximal Independent Set Problem
  • M. Luby
  • SIAM J. Comput.
  • 1986
    • Corpus ID: 23987873
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS… Expand
Highly Cited
1985
Highly Cited
1985
A simple parallel algorithm for the maximal independent set problem
  • M. Luby
  • STOC '85
  • 1985
    • Corpus ID: 1126858
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… Expand
Highly Cited
1980
Highly Cited
1980
On maximal independent sets of vertices in claw-free graphs
  • G. Minty
  • J. Comb. Theory, Ser. B
  • 1980
    • Corpus ID: 28337407
Abstract A graph is claw-free if: whenever three (distinct) vertices are joined to a single vertex, those three vertices are a… Expand
  • figure I
  • figure 2
  • figure 3
  • figure 5
Highly Cited
1977
Highly Cited
1977
A New Algorithm for Generating All the Maximal Independent Sets
The problem of generating all the maximal independent sets (or maximal cliques) of a given graph is fundamental in graph theory… Expand
Highly Cited
1974
Highly Cited
1974
THE MAXIMAL COVERING LOCATION PROBLEM
The belief that mathematical location modeling can identify "optimal" location patterns rests on the basis that some realistic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE