An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Set of vertices in a graph, no two of which are adjacent

Property Value
dbo:description
  • Begriff aus der Graphentheorie (de)
  • קבוצת קודקודים שבה אין זוג קודקודים שמחוברים בקשת אחת (iw)
  • egy gráfban olyan csúcsok halmaza, melyek közül semelyik kettő sem szomszédos (hu)
  • set of vertices in a graph, no two of which are adjacent (en)
  • pojęcie teorii grafów (pl)
  • aro de verticoj en grafo tiaj, ke neniun paron el ili konektas eĝo (eo)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageWikiLink
dbp:date
  • 2013-05-29 (xsd:date)
dbp:title
  • Maximal Independent Vertex Set (en)
dbp:url
dbp:urlname
  • MaximalIndependentVertexSet (en)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:label
  • Independent set (graph theory) (en)
  • مجموعة مستقلة (نظرية الرسومات) (ar)
  • Nezávislá množina (cs)
  • Stabile Menge (de)
  • Conjunto independiente (es)
  • Himpunan bebas (teori graf) (in)
  • Stable (théorie des graphes) (fr)
  • 独立集合 (ja)
  • Insieme indipendente (teoria dei grafi) (it)
  • 독립집합 (ko)
  • Onafhankelijke verzameling (nl)
  • Conjunto independente (pt)
  • Zbiór niezależny (pl)
  • Независимое множество (ru)
  • Oberoende mängd (sv)
  • 独立集 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International