Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Shannon_capacity_of_a_graph> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Shannon_capacity_of_a_graph abstract "In graph theory, the Shannon capacity of a graph is a graph invariant defined from the number of independent sets of strong graph products. It measures the Shannon capacity of a communications channel defined from the graph, and is upper bounded by the Lovász number, which can be computed in polynomial time. However, the computational complexity of the Shannon capacity itself remains unknown.".
- Shannon_capacity_of_a_graph thumbnail Cycle_graph_C5.png?width=300.
- Shannon_capacity_of_a_graph wikiPageID "39932177".
- Shannon_capacity_of_a_graph wikiPageLength "11459".
- Shannon_capacity_of_a_graph wikiPageOutDegree "28".
- Shannon_capacity_of_a_graph wikiPageRevisionID "664143766".
- Shannon_capacity_of_a_graph wikiPageWikiLink Category:Graph_invariants.
- Shannon_capacity_of_a_graph wikiPageWikiLink Category:Information_theory.
- Shannon_capacity_of_a_graph wikiPageWikiLink Channel_(communications).
- Shannon_capacity_of_a_graph wikiPageWikiLink Channel_capacity.
- Shannon_capacity_of_a_graph wikiPageWikiLink Code_word.
- Shannon_capacity_of_a_graph wikiPageWikiLink Computational_complexity_theory.
- Shannon_capacity_of_a_graph wikiPageWikiLink Cycle_graph.
- Shannon_capacity_of_a_graph wikiPageWikiLink Ellipsoid_method.
- Shannon_capacity_of_a_graph wikiPageWikiLink Field_(mathematics).
- Shannon_capacity_of_a_graph wikiPageWikiLink Graph_property.
- Shannon_capacity_of_a_graph wikiPageWikiLink Graph_theory.
- Shannon_capacity_of_a_graph wikiPageWikiLink Independent_set_(graph_theory).
- Shannon_capacity_of_a_graph wikiPageWikiLink Lovász_number.
- Shannon_capacity_of_a_graph wikiPageWikiLink Modular_arithmetic.
- Shannon_capacity_of_a_graph wikiPageWikiLink NP-hardness.
- Shannon_capacity_of_a_graph wikiPageWikiLink Pentagon.
- Shannon_capacity_of_a_graph wikiPageWikiLink String_(computer_science).
- Shannon_capacity_of_a_graph wikiPageWikiLink Strong_product_of_graphs.
- Shannon_capacity_of_a_graph wikiPageWikiLink Time_complexity.
- Shannon_capacity_of_a_graph wikiPageWikiLink File:Cycle_graph_C5.png.
- Shannon_capacity_of_a_graph wikiPageWikiLinkText "Shannon capacity of a graph".
- Shannon_capacity_of_a_graph wikiPageWikiLinkText "Shannon capacity".
- Shannon_capacity_of_a_graph wikiPageWikiLinkText "Shannon_capacity_of_a_graph#Graph_models_of_communication_channels".
- Shannon_capacity_of_a_graph wikiPageUsesTemplate Template:Harvtxt.
- Shannon_capacity_of_a_graph wikiPageUsesTemplate Template:Reflist.
- Shannon_capacity_of_a_graph wikiPageUsesTemplate Template:Sqrt.
- Shannon_capacity_of_a_graph subject Category:Graph_invariants.
- Shannon_capacity_of_a_graph subject Category:Information_theory.
- Shannon_capacity_of_a_graph hypernym Invariant.
- Shannon_capacity_of_a_graph comment "In graph theory, the Shannon capacity of a graph is a graph invariant defined from the number of independent sets of strong graph products. It measures the Shannon capacity of a communications channel defined from the graph, and is upper bounded by the Lovász number, which can be computed in polynomial time. However, the computational complexity of the Shannon capacity itself remains unknown.".
- Shannon_capacity_of_a_graph label "Shannon capacity of a graph".
- Shannon_capacity_of_a_graph sameAs Q17105770.
- Shannon_capacity_of_a_graph sameAs m.0w7nr1q.
- Shannon_capacity_of_a_graph sameAs Q17105770.
- Shannon_capacity_of_a_graph wasDerivedFrom Shannon_capacity_of_a_graph?oldid=664143766.
- Shannon_capacity_of_a_graph depiction Cycle_graph_C5.png.
- Shannon_capacity_of_a_graph isPrimaryTopicOf Shannon_capacity_of_a_graph.