Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Independent set (graph theory)
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
wiki-commons
:Special:FilePath/Independent_set_graph.svg?width=300
dbo:
wikiPageExternalLink
http://www.hananayad.com/teaching/syde423/IndependentSet.pdf
http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm
dbo:
wikiPageWikiLink
dbr
:Synthetic_biology
dbc
:NP-complete_problems
dbc
:Computational_problems_in_graph_theory
dbr
:NP-completeness
dbr
:Clique_(graph_theory)
dbc
:Graph_theory_objects
dbr
:Perrin_number
dbr
:Optimization_problem
dbr
:Lecture_Notes_in_Computer_Science
dbr
:Vertex_cover
dbr
:Matching_(graph_theory)
dbr
:Padovan_sequence
dbr
:Claw-free_graph
dbr
:Complement_graph
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Ramsey_theory
dbr
:Information_and_Computation
dbr
:Israel_Journal_of_Mathematics
dbr
:Cycle_graph
dbr
:Earliest_deadline_first_scheduling
dbr
:Chordal_graph
dbr
:Interval_graph
dbr
:Clique_problem
dbr
:Vertex_(graph_theory)
dbr
:Plastic_number
dbr
:Graph_theory
dbr
:Bipartite_graph
dbr
:Proper_subset
dbr
:Springer_Science+Business_Media
dbr
:Graph_coloring
dbr
:Greedy_algorithm
dbr
:Algorithmica
dbr
:Dense_graph
dbr
:Cograph
dbr
:Computer_science
dbr
:Partition_of_a_set
dbr
:Truth_value
dbr
:Computational_complexity_theory
dbr
:Edge_covering
dbr
:Dominating_set
dbr
:Maximal_independent_set
dbr
:Approximation_algorithm
dbr
:Polynomial-time_approximation_scheme
dbr
:Journal_of_the_ACM
dbr
:Intersection_graph
dbr
:Discrete_&_Computational_Geometry
dbr
:Strong_NP-completeness
dbr
:Automatic_label_placement
dbr
:Path_graph
dbr
:Gene_regulatory_network
dbr
:Brute-force_search
dbr
:Edge_(graph_theory)
dbr
:Graph_(discrete_mathematics)
dbr
:Planar_graph
dbr
:Combinatorica
dbr
:Perfect_graph
dbr
:APX
dbr
:Minor_(graph_theory)
dbr
:Modular_decomposition
dbr
:Journal_of_Graph_Theory
dbr
:Springer-Verlag
dbr
:SIAM_Journal_on_Computing
dbr
:NP-complete
dbr
:NP-hard
dbr
:Polynomial_time
dbr
:Theoretical_Computer_Science
dbr
:SNP_(complexity)
dbr
:Clique_separator
dbr
:File:Independent_set_graph.svg
dbr
:Journal_of_Operations_Research_Society_Japan
dbr
:Journal_of_Combinatorial_Theory,_Series_B
dbr
:Approximation_ratio
dbr
:Computational_problems
dbr
:Job_scheduling
dbr
:SODA_(Symposium_on_Discrete_Algorithms)
dbr
:Vertex_coloring
dbp:
date
2013-05-29
(xsd:date)
dbp:
title
Maximal Independent Vertex Set
(en)
dbp:
url
https://web.archive.org/web/20130529163947/http:/www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm
dbp:
urlname
MaximalIndependentVertexSet
(en)
dbp:
wikiPageUsesTemplate
dbt
:Sfn_whitelist
dbt
:Main
dbt
:Reflist
dbt
:Citation
dbt
:Refend
dbt
:MathWorld
dbt
:Refbegin
dbt
:Harvtxt
dbt
:See
dbt
:Webarchive
dbt
:Unsolved
dbt
:Cite_Geometric_Algorithms_and_Combinatorial_Optimization
dbt
:Covering-Packing_Problem_Pairs
dbt
:Short_description
dct:
subject
dbc
:NP-complete_problems
dbc
:Computational_problems_in_graph_theory
dbc
:Graph_theory_objects
gold:
hypernym
dbr
:Set
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
dbpedia-de
:Independent set (graph theory)
freebase
:Independent set (graph theory)
yago-res
:Independent set (graph theory)
wikidata
:Independent set (graph theory)
dbpedia-it
:Independent set (graph theory)
dbpedia-nl
:Independent set (graph theory)
dbpedia-fr
:Independent set (graph theory)
dbpedia-zh
:Independent set (graph theory)
dbpedia-ja
:Independent set (graph theory)
dbpedia-pt
:Independent set (graph theory)
dbpedia-he
:Independent set (graph theory)
dbpedia-es
:Independent set (graph theory)
dbpedia-hu
:Independent set (graph theory)
dbpedia-fa
:Independent set (graph theory)
dbpedia-ru
:Independent set (graph theory)
dbpedia-sv
:Independent set (graph theory)
dbpedia-vi
:Independent set (graph theory)
dbpedia-pl
:Independent set (graph theory)
dbpedia-ko
:Independent set (graph theory)
dbpedia-id
:Independent set (graph theory)
dbpedia-ar
:Independent set (graph theory)
dbpedia-cs
:Independent set (graph theory)
dbpedia-sk
:Independent set (graph theory)
dbpedia-sr
:Independent set (graph theory)
dbpedia-th
:Independent set (graph theory)
dbpedia-global
:Independent set (graph theory)
dbr
:Independent set (graph theory)
prov:
wasDerivedFrom
wikipedia-en
:Independent_set_(graph_theory)?oldid=1294758827&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Independent_set_graph.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Independent_set_(graph_theory)
is
dbo:
wikiPageDisambiguates
of
dbr
:Independent_set
is
dbo:
wikiPageRedirects
of
dbr
:Independence_number
dbr
:Maximum_independent_set
dbr
:Maximum_independent_set_problem
dbr
:Independence_(graph_theory)
dbr
:Maximum_independent-set
dbr
:Anticlique
dbr
:Approximation_algorithms_for_the_maximum_independent_set_problem
dbr
:Coclique
dbr
:Independent_Set_problem
dbr
:Independent_set_problem
dbr
:Vertex_independent_set
dbr
:Vertex_packing
is
dbo:
wikiPageWikiLink
of
dbr
:Extremal_graph_theory
dbr
:Parameterized_complexity
dbr
:Intersection_number_(graph_theory)
dbr
:Interval_scheduling
dbr
:Shannon_capacity_of_a_graph
dbr
:Maximum_disjoint_set
dbr
:227_(number)
dbr
:Glossary_of_graph_theory
dbr
:Erdős–Ko–Rado_theorem
dbr
:Kayles
dbr
:Clique_(graph_theory)
dbr
:Turán's_theorem
dbr
:Multipartite_graph
dbr
:Perfect_graph_theorem
dbr
:Longest_increasing_subsequence
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Rook's_graph
dbr
:Linear_programming
dbr
:Neighbourhood_(graph_theory)
dbr
:Vertex_cover
dbr
:Independence_number
dbr
:Maximum_independent_set
dbr
:Maximum_independent_set_problem
dbr
:Chromatic_polynomial
dbr
:Clique_cover
dbr
:Search_problem
dbr
:Claw-free_graph
dbr
:Courcelle's_theorem
dbr
:Covering_problems
dbr
:Hadwiger_number
dbr
:Hajós_construction
dbr
:Linkless_embedding
dbr
:Odd_graph
dbr
:Complement_graph
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Split_graph
dbr
:Bidimensionality
dbr
:Induced_subgraph_isomorphism_problem
dbr
:Eight_queens_puzzle
dbr
:Interval_graph
dbr
:Vertex_(graph_theory)
dbr
:Independent_set
dbr
:Birkhoff's_representation_theorem
dbr
:Graph_theory
dbr
:Binary_logarithm
dbr
:Bipartite_graph
dbr
:Andrew_M._Gleason
dbr
:Graph_coloring
dbr
:Greedy_algorithm
dbr
:288_(number)
dbr
:Girth_(graph_theory)
dbr
:Certificate_(complexity)
dbr
:Hoffman–Singleton_graph
dbr
:Abstract_simplicial_complex
dbr
:Exact_coloring
dbr
:Cocoloring
dbr
:Induced_subgraph
dbr
:Cubic_graph
dbr
:Dominating_set
dbr
:Bull_graph
dbr
:Coxeter_graph
dbr
:Higman–Sims_graph
dbr
:M22_graph
dbr
:Complete_coloring
dbr
:Domatic_number
dbr
:Probabilistic_method
dbr
:Point_location
dbr
:Trapezoid_graph
dbr
:Maximal_independent_set
dbr
:Uniquely_colorable_graph
dbr
:Approximation_algorithm
dbr
:Set_packing
dbr
:Spectral_graph_theory
dbr
:Apollonian_network
dbr
:Fractional_coloring
dbr
:List_of_graph_theory_topics
dbr
:Strong_coloring
dbr
:PLS_(complexity)
dbr
:Packing_in_a_hypergraph
dbr
:Line_graph
dbr
:Ramsey's_theorem
dbr
:Expander_graph
dbr
:Dilworth's_theorem
dbr
:Vizing's_theorem
dbr
:Computational_problem
dbr
:Fibonacci_cube
dbr
:Moser_spindle
dbr
:Defective_coloring
dbr
:Randomized_rounding
dbr
:Flag_algebra
dbr
:Container_method
dbr
:Clebsch_graph
dbr
:743_(number)
dbr
:Threshold_graph
dbr
:Union-closed_sets_conjecture
dbr
:Holographic_algorithm
dbr
:Permutation_graph
dbr
:Method_of_conditional_probabilities
dbr
:Metric_k-center
dbr
:Triangle-free_graph
dbr
:Transversal_(combinatorics)
dbr
:2-satisfiability
dbr
:APX
dbr
:Baker's_technique
dbr
:Book_embedding
dbr
:Lovász_number
dbr
:Stable_set
dbr
:Dually_chordal_graph
dbr
:Incidence_coloring
dbr
:Grundy_number
dbr
:Iterative_compression
dbr
:Erdős–Hajnal_conjecture
dbr
:Dulmage–Mendelsohn_decomposition
dbr
:Quantum_contextuality
dbr
:Quasi-bipartite_graph
dbr
:Meyniel_graph
dbr
:Tree_contraction
dbr
:Word-representable_graph
dbr
:Rainbow-independent_set
dbr
:Nondeterministic_constraint_logic
dbr
:Pseudorandom_graph
dbr
:Independence_complex
dbr
:Rectangle_packing
dbr
:Width_of_a_hypergraph
dbr
:Well-covered_graph
dbr
:Queen's_graph
dbr
:Ermelinda_DeLaViña
dbr
:Enumeration_algorithm
dbr
:Universal_vertex
dbr
:Independence_(graph_theory)
dbr
:Induced_path
dbr
:Induced_matching
dbr
:Deficiency_(graph_theory)
dbr
:Splittance
dbr
:Ramsey-Turán_theory
dbr
:Separation_oracle
dbr
:Path_cover
dbr
:Graph_entropy
dbr
:Skew-merged_permutation
dbr
:Erdős–Dushnik–Miller_theorem
dbr
:Maximum_independent-set
dbr
:Anticlique
dbr
:Approximation_algorithms_for_the_maximum_independent_set_problem
dbr
:Coclique
dbr
:Independent_Set_problem
dbr
:Independent_set_problem
dbr
:Vertex_independent_set
dbr
:Vertex_packing
is
foaf:
primaryTopic
of
wikipedia-en
:Independent_set_(graph_theory)
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International