Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q924362> ?p ?o }
Showing triples 1 to 64 of
64
with 100 triples per page.
- Q924362 subject Q7132783.
- Q924362 subject Q7481159.
- Q924362 abstract "In the mathematical discipline of graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set.The problem of finding a minimum vertex cover is a classical optimization problem in computer science and is a typical example of an NP-hard optimization problem that has an approximation algorithm. Its decision version, the vertex cover problem, was one of Karp's 21 NP-complete problems and is therefore a classical NP-complete problem in computational complexity theory. Furthermore, the vertex cover problem is fixed-parameter tractable and a central problem in parameterized complexity theory.The minimum vertex cover problem can be formulated as a half-integral linear program whose dual linear program is the maximum matching problem.".
- Q924362 thumbnail Vertex-cover.svg?width=300.
- Q924362 wikiPageExternalLink books?id=IMmuF0RZk1MC&pg=PA169.
- Q924362 wikiPageExternalLink HMinorFree_JACM.
- Q924362 wikiPageExternalLink citation.cfm?id=781528.
- Q924362 wikiPageExternalLink citation.cfm?id=803884.
- Q924362 wikiPageExternalLink results?SGWID=5-40109-22-141358322-0.
- Q924362 wikiPageWikiLink Q1060343.
- Q924362 wikiPageWikiLink Q1065144.
- Q924362 wikiPageWikiLink Q1137554.
- Q924362 wikiPageWikiLink Q1140200.
- Q924362 wikiPageWikiLink Q1141518.
- Q924362 wikiPageWikiLink Q1192100.
- Q924362 wikiPageWikiLink Q1196873.
- Q924362 wikiPageWikiLink Q131476.
- Q924362 wikiPageWikiLink Q1374495.
- Q924362 wikiPageWikiLink Q141488.
- Q924362 wikiPageWikiLink Q1512771.
- Q924362 wikiPageWikiLink Q1570441.
- Q924362 wikiPageWikiLink Q15762676.
- Q924362 wikiPageWikiLink Q1709878.
- Q924362 wikiPageWikiLink Q1734364.
- Q924362 wikiPageWikiLink Q174733.
- Q924362 wikiPageWikiLink Q202843.
- Q924362 wikiPageWikiLink Q205084.
- Q924362 wikiPageWikiLink Q21198.
- Q924362 wikiPageWikiLink Q215206.
- Q924362 wikiPageWikiLink Q2275559.
- Q924362 wikiPageWikiLink Q2393193.
- Q924362 wikiPageWikiLink Q242767.
- Q924362 wikiPageWikiLink Q272735.
- Q924362 wikiPageWikiLink Q3262192.
- Q924362 wikiPageWikiLink Q395.
- Q924362 wikiPageWikiLink Q4653447.
- Q924362 wikiPageWikiLink Q504353.
- Q924362 wikiPageWikiLink Q5179260.
- Q924362 wikiPageWikiLink Q5421532.
- Q924362 wikiPageWikiLink Q547823.
- Q924362 wikiPageWikiLink Q564426.
- Q924362 wikiPageWikiLink Q616554.
- Q924362 wikiPageWikiLink Q621751.
- Q924362 wikiPageWikiLink Q6295014.
- Q924362 wikiPageWikiLink Q6322802.
- Q924362 wikiPageWikiLink Q7132783.
- Q924362 wikiPageWikiLink Q746242.
- Q924362 wikiPageWikiLink Q7481159.
- Q924362 wikiPageWikiLink Q7661893.
- Q924362 wikiPageWikiLink Q7886950.
- Q924362 wikiPageWikiLink Q833449.
- Q924362 wikiPageWikiLink Q840247.
- Q924362 wikiPageWikiLink Q850362.
- Q924362 wikiPageWikiLink Q875276.
- Q924362 wikiPageWikiLink Q897769.
- Q924362 wikiPageWikiLink Q913598.
- Q924362 wikiPageWikiLink Q92810.
- Q924362 wikiPageWikiLink Q92811.
- Q924362 wikiPageWikiLink Q92825.
- Q924362 wikiPageWikiLink Q938821.
- Q924362 wikiPageWikiLink Q984063.
- Q924362 comment "In the mathematical discipline of graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set.The problem of finding a minimum vertex cover is a classical optimization problem in computer science and is a typical example of an NP-hard optimization problem that has an approximation algorithm.".
- Q924362 label "Vertex cover".
- Q924362 depiction Vertex-cover.svg.