Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Edge_cover> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples per page.
- Edge_cover abstract "In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set.In computer science, the minimum edge cover problem is the problem of finding an edge cover of minimum size. It is an optimization problem that belongs to the class of covering problems and can be solved in polynomial time.".
- Edge_cover thumbnail Edge-cover.svg?width=300.
- Edge_cover wikiPageID "4577392".
- Edge_cover wikiPageLength "3451".
- Edge_cover wikiPageOutDegree "24".
- Edge_cover wikiPageRevisionID "702633892".
- Edge_cover wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Edge_cover wikiPageWikiLink Category:Polynomial-time_problems.
- Edge_cover wikiPageWikiLink Complete_bipartite_graph.
- Edge_cover wikiPageWikiLink Computer_science.
- Edge_cover wikiPageWikiLink Computers_and_Intractability.
- Edge_cover wikiPageWikiLink Covering_problems.
- Edge_cover wikiPageWikiLink Graph_(discrete_mathematics).
- Edge_cover wikiPageWikiLink Graph_theory.
- Edge_cover wikiPageWikiLink Matching_(graph_theory).
- Edge_cover wikiPageWikiLink NP-hardness.
- Edge_cover wikiPageWikiLink Optimization_problem.
- Edge_cover wikiPageWikiLink Set_cover_problem.
- Edge_cover wikiPageWikiLink Time_complexity.
- Edge_cover wikiPageWikiLink Vertex_(graph_theory).
- Edge_cover wikiPageWikiLink Vertex_cover.
- Edge_cover wikiPageWikiLink File:Edge-cover.svg.
- Edge_cover wikiPageWikiLink File:Minimum-edge-cover-from-maximum-matching.svg.
- Edge_cover wikiPageWikiLink File:Minimum-edge-cover.svg.
- Edge_cover wikiPageWikiLinkText "Edge cover".
- Edge_cover wikiPageWikiLinkText "edge cover".
- Edge_cover title "Edge Cover".
- Edge_cover urlname "EdgeCover".
- Edge_cover wikiPageUsesTemplate Template:Citation.
- Edge_cover wikiPageUsesTemplate Template:Covering-Packing_Problem_Pairs.
- Edge_cover wikiPageUsesTemplate Template:MathWorld.
- Edge_cover wikiPageUsesTemplate Template:Reflist.
- Edge_cover subject Category:Computational_problems_in_graph_theory.
- Edge_cover subject Category:Polynomial-time_problems.
- Edge_cover hypernym Set.
- Edge_cover type Invariant.
- Edge_cover type Object.
- Edge_cover comment "In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set.In computer science, the minimum edge cover problem is the problem of finding an edge cover of minimum size. It is an optimization problem that belongs to the class of covering problems and can be solved in polynomial time.".
- Edge_cover label "Edge cover".
- Edge_cover sameAs Q594001.
- Edge_cover sameAs Cobertura_de_aristas.
- Edge_cover sameAs Edge_cover.
- Edge_cover sameAs Copertura_degli_spigoli.
- Edge_cover sameAs Kantenbedekking.
- Edge_cover sameAs Cobertura_de_arestas_(teoria_dos_grafos).
- Edge_cover sameAs m.05m_zwz.
- Edge_cover sameAs Q594001.
- Edge_cover wasDerivedFrom Edge_cover?oldid=702633892.
- Edge_cover depiction Edge-cover.svg.
- Edge_cover isPrimaryTopicOf Edge_cover.