Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

maximum independent set problem · Vinony

🌐English

English Deutsch Español Français Italiano Polski Türkçe Русский

EntityQ25416569· pop 7

maximum independent set problem

Also known as independent set problem

problem to find an independent set of graph vertices of maximal size

Available in 7 languages

Français
Deutsch
Русский
Polski
Türkçe
Ukrainian

via Wikidata sitelinks · CC0

Connections

independent set

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

longest path problem

Entitydist 0.47

degree diameter problem

Entitydist 0.53

Entitydist 0.57

Entitydist 0.59

Entitydist 0.60

assignment problem

Entitydist 0.61

Steiner tree problem

Entitydist 0.62

Entitydist 0.66

Ménage problem

Entitydist 0.67

Entitydist 0.68

minimum bounding rectangle

Entitydist 0.69

knapsack problem

Entitydist 0.70