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
2018
Review
2018
The clustering of the SDSS-IV extended Baryon Oscillation Spectroscopic Survey DR14 quasar sample: a tomographic measurement of cosmic structure growth and expansion rate based on optimal redshift…
We develop a new method, which is based on the optimal redshift weighting scheme, to extract the maximal tomographic information… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Review
2017
Review
2017
Rindopepimut With Temozolomide for Patients With Newly Diagnosed EGFRVIII-Expressing Glioblastoma (Act IV): A Randomised Double-Blind International Phase 3 Trial
Summary Background Rindopepimut (also known as CDX-110), a vaccine targeting the EGFR deletion mutation EGFRvIII, consists of an… Expand
Is this relevant?
Review
2017
Review
2017
Unified models of neutrinos, flavour and CP Violation
Abstract Recent data from neutrino experiments gives intriguing hints about the mass ordering, the C P violating phase and non… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2016
Review
2016
SPARC: MASS MODELS FOR 175 DISK GALAXIES WITH SPITZER PHOTOMETRY AND ACCURATE ROTATION CURVES
We introduce SPARC (Spitzer Photometry & Accurate Rotation Curves): a sample of 175 nearby galaxies with new surface photometry… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Review
2016
Review
2016
Digital Phased Arrays: Challenges and Opportunities
Digital beamforming (DBF) has long been heralded as the next frontier in phased array technology, and not without reason. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A simple parallel algorithm for the maximal independent set problem
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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