Home › Entities › Computational Problem › maximum independent set problem

maximum independent set problem

problem to find an independent set of graph vertices of maximal size
Thing Computational Problem Q25416569

Facts

6 properties
Instance of
computational problem
Facet of
maximum independent set[3]
Computational complexity
NP-complete[7]
Different from
maximal independent set, maximum independent set[4][5]
Maintained by WikiProject
WikiProject Mathematics[6]
Opposite of
clique problem[2]
🏷️ Also known as
en independent set problem en maximum independent set problem de Stabilitätsproblem es problema del conjunto independiente maximo es problema del conjunto independiente fr problème du stable fr problème du stable maximum it problema dell'insieme indipendente massimo pl problem zbioru niezależnego ru задача о наибольшем независимом множестве ru задача о наибольшем независимом наборе ru задача о независимом множестве ru задача о независимом наборе tr Bağımsız küme problemi uk задача про максимальну за розміром незалежну множину uk задача про незалежну множину
🔖 Identifiers · 3
Google Knowledge Graph ID
/g/122723k2
Graphclasses.org ID
problem_Independent_set
MathWorld ID
MaximumIndependentSetProblem

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Computational complexity 1
NP-complete
Different from 1
maximal independent set
Instance of 1
computational problem
Maintained by WikiProject 1
WikiProject Mathematics
Opposite of 1
clique problem
← Different from 1
maximal independent set
← Opposite of 1
clique problem
Press Enter · cited answer in seconds

Summary

maximum independent set problem is a computational problem[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). maximum independent set problem. Retrieved November 11, 2026, from https://4ort.xyz/entity/maximum-independent-set-problem
MLA “maximum independent set problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 11 Nov. 2026, https://4ort.xyz/entity/maximum-independent-set-problem.
BibTeX @misc{4ortxyz_maximum-independent-set-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{maximum independent set problem}}, year = {2026}, url = {https://4ort.xyz/entity/maximum-independent-set-problem}, note = {Accessed: 2026-11-11}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): maximum independent set problem — https://4ort.xyz/entity/maximum-independent-set-problem (retrieved 2026-11-11)

Canonical URL: https://4ort.xyz/entity/maximum-independent-set-problem · Last refreshed: