Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Edge_dominating_set> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples per page.
- Edge_dominating_set abstract "In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is also known as a line dominating set. Figures (a)–(d) are examples of edge dominating sets (thick red lines).A minimum edge dominating set is a smallest edge dominating set. Figures (a) and (b) are examples of minimum edge dominating sets (it can be checked that there is no edge dominating set of size 2 for this graph).".
- Edge_dominating_set thumbnail Edge-dominating-set.svg?width=300.
- Edge_dominating_set wikiPageExternalLink wwwcompendium.
- Edge_dominating_set wikiPageExternalLink node13.html.
- Edge_dominating_set wikiPageExternalLink node21.html.
- Edge_dominating_set wikiPageID "21689422".
- Edge_dominating_set wikiPageLength "5021".
- Edge_dominating_set wikiPageOutDegree "15".
- Edge_dominating_set wikiPageRevisionID "681743567".
- Edge_dominating_set wikiPageWikiLink Approximation_algorithm.
- Edge_dominating_set wikiPageWikiLink Bipartite_graph.
- Edge_dominating_set wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Edge_dominating_set wikiPageWikiLink Category:NP-complete_problems.
- Edge_dominating_set wikiPageWikiLink Computers_and_Intractability.
- Edge_dominating_set wikiPageWikiLink Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness.
- Edge_dominating_set wikiPageWikiLink Dominating_set.
- Edge_dominating_set wikiPageWikiLink Gerhard_J._Woeginger.
- Edge_dominating_set wikiPageWikiLink Graph_theory.
- Edge_dominating_set wikiPageWikiLink Line_graph.
- Edge_dominating_set wikiPageWikiLink Matching_(graph_theory).
- Edge_dominating_set wikiPageWikiLink Maximal_matching.
- Edge_dominating_set wikiPageWikiLink Minimum_maximal_matching.
- Edge_dominating_set wikiPageWikiLink NP-complete.
- Edge_dominating_set wikiPageWikiLink NP-completeness.
- Edge_dominating_set wikiPageWikiLink NP-hard.
- Edge_dominating_set wikiPageWikiLink NP-hardness.
- Edge_dominating_set wikiPageWikiLink Planar_graph.
- Edge_dominating_set wikiPageWikiLink File:Edge-dominating-set.svg.
- Edge_dominating_set wikiPageWikiLinkText "Edge dominating set".
- Edge_dominating_set wikiPageWikiLinkText "edge dominating set".
- Edge_dominating_set hasPhotoCollection Edge_dominating_set.
- Edge_dominating_set wikiPageUsesTemplate Template:Citation.
- Edge_dominating_set wikiPageUsesTemplate Template:Harv.
- Edge_dominating_set wikiPageUsesTemplate Template:Harvnb.
- Edge_dominating_set wikiPageUsesTemplate Template:Harvtxt.
- Edge_dominating_set wikiPageUsesTemplate Template:See.
- Edge_dominating_set subject Category:Computational_problems_in_graph_theory.
- Edge_dominating_set subject Category:NP-complete_problems.
- Edge_dominating_set hypernym E.
- Edge_dominating_set type Album.
- Edge_dominating_set comment "In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is also known as a line dominating set. Figures (a)–(d) are examples of edge dominating sets (thick red lines).A minimum edge dominating set is a smallest edge dominating set. Figures (a) and (b) are examples of minimum edge dominating sets (it can be checked that there is no edge dominating set of size 2 for this graph).".
- Edge_dominating_set label "Edge dominating set".
- Edge_dominating_set sameAs m.05mxsq3.
- Edge_dominating_set sameAs Q5337698.
- Edge_dominating_set sameAs Q5337698.
- Edge_dominating_set wasDerivedFrom Edge_dominating_set?oldid=681743567.
- Edge_dominating_set depiction Edge-dominating-set.svg.
- Edge_dominating_set isPrimaryTopicOf Edge_dominating_set.