Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q776602> ?p ?o }
Showing triples 1 to 71 of
71
with 100 triples per page.
- Q776602 subject Q7217193.
- Q776602 abstract "In combinatorics, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.".
- Q776602 wikiPageExternalLink expander_graphs.pdf.
- Q776602 wikiPageExternalLink index.html.
- Q776602 wikiPageExternalLink what-is.pdf.
- Q776602 wikiPageExternalLink expander_survey.pdf.
- Q776602 wikiPageExternalLink ExpanderCourse.
- Q776602 wikiPageExternalLink specgraph.html.
- Q776602 wikiPageWikiLink Q1070305.
- Q776602 wikiPageWikiLink Q1077896.
- Q776602 wikiPageWikiLink Q1140200.
- Q776602 wikiPageWikiLink Q1192782.
- Q776602 wikiPageWikiLink Q1301371.
- Q776602 wikiPageWikiLink Q1304193.
- Q776602 wikiPageWikiLink Q132095.
- Q776602 wikiPageWikiLink Q141488.
- Q776602 wikiPageWikiLink Q1425077.
- Q776602 wikiPageWikiLink Q1425084.
- Q776602 wikiPageWikiLink Q159943.
- Q776602 wikiPageWikiLink Q1665115.
- Q776602 wikiPageWikiLink Q1709878.
- Q776602 wikiPageWikiLink Q17103817.
- Q776602 wikiPageWikiLink Q176583.
- Q776602 wikiPageWikiLink Q176645.
- Q776602 wikiPageWikiLink Q183427.
- Q776602 wikiPageWikiLink Q190524.
- Q776602 wikiPageWikiLink Q205084.
- Q776602 wikiPageWikiLink Q21198.
- Q776602 wikiPageWikiLink Q230655.
- Q776602 wikiPageWikiLink Q2642629.
- Q776602 wikiPageWikiLink Q3085841.
- Q776602 wikiPageWikiLink Q3115527.
- Q776602 wikiPageWikiLink Q3387984.
- Q776602 wikiPageWikiLink Q339011.
- Q776602 wikiPageWikiLink Q383444.
- Q776602 wikiPageWikiLink Q4166054.
- Q776602 wikiPageWikiLink Q4306188.
- Q776602 wikiPageWikiLink Q45715.
- Q776602 wikiPageWikiLink Q465654.
- Q776602 wikiPageWikiLink Q4723998.
- Q776602 wikiPageWikiLink Q5089259.
- Q776602 wikiPageWikiLink Q5089261.
- Q776602 wikiPageWikiLink Q5089262.
- Q776602 wikiPageWikiLink Q5420758.
- Q776602 wikiPageWikiLink Q5420759.
- Q776602 wikiPageWikiLink Q5422192.
- Q776602 wikiPageWikiLink Q583461.
- Q776602 wikiPageWikiLink Q605807.
- Q776602 wikiPageWikiLink Q6138961.
- Q776602 wikiPageWikiLink Q646477.
- Q776602 wikiPageWikiLink Q7217193.
- Q776602 wikiPageWikiLink Q7255474.
- Q776602 wikiPageWikiLink Q727035.
- Q776602 wikiPageWikiLink Q7291988.
- Q776602 wikiPageWikiLink Q7575194.
- Q776602 wikiPageWikiLink Q7604341.
- Q776602 wikiPageWikiLink Q761383.
- Q776602 wikiPageWikiLink Q76592.
- Q776602 wikiPageWikiLink Q772067.
- Q776602 wikiPageWikiLink Q8071744.
- Q776602 wikiPageWikiLink Q82571.
- Q776602 wikiPageWikiLink Q826467.
- Q776602 wikiPageWikiLink Q8366.
- Q776602 wikiPageWikiLink Q859174.
- Q776602 wikiPageWikiLink Q8789.
- Q776602 wikiPageWikiLink Q912887.
- Q776602 wikiPageWikiLink Q92927.
- Q776602 wikiPageWikiLink Q956437.
- Q776602 wikiPageWikiLink Q989220.
- Q776602 comment "In combinatorics, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.".
- Q776602 label "Expander graph".