Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Path_cover> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Path_cover abstract "Given a directed graph G = (V, E), a path cover is a set of directed paths such that every vertex v ∈ V belongs to at least one path. Note that a path cover may include paths of length 0 (a single vertex).A path cover may also refer to a vertex-disjoint path cover, i.e., a set of paths such that every vertex v ∈ V belongs to exactly one path.".
- Path_cover wikiPageExternalLink dbook.
- Path_cover wikiPageExternalLink graph.theory.
- Path_cover wikiPageExternalLink abs_all.jsp?arnumber=1702662.
- Path_cover wikiPageExternalLink 1761.html.
- Path_cover wikiPageID "2243546".
- Path_cover wikiPageLength "3065".
- Path_cover wikiPageOutDegree "11".
- Path_cover wikiPageRevisionID "646020227".
- Path_cover wikiPageWikiLink Australian_Mathematical_Society.
- Path_cover wikiPageWikiLink Category:Graph_theory_objects.
- Path_cover wikiPageWikiLink Covering.
- Path_cover wikiPageWikiLink Dilworths_theorem.
- Path_cover wikiPageWikiLink Directed_graph.
- Path_cover wikiPageWikiLink Hamiltonian_path.
- Path_cover wikiPageWikiLink Hamiltonian_path_problem.
- Path_cover wikiPageWikiLink Independent_set_(graph_theory).
- Path_cover wikiPageWikiLink NP-completeness.
- Path_cover wikiPageWikiLink NP-hardness.
- Path_cover wikiPageWikiLink Path_(graph_theory).
- Path_cover wikiPageWikiLinkText "Path cover".
- Path_cover wikiPageWikiLinkText "path cover".
- Path_cover wikiPageUsesTemplate Template:Citation.
- Path_cover wikiPageUsesTemplate Template:Compsci-stub.
- Path_cover wikiPageUsesTemplate Template:Reflist.
- Path_cover subject Category:Graph_theory_objects.
- Path_cover hypernym Set.
- Path_cover type Object.
- Path_cover comment "Given a directed graph G = (V, E), a path cover is a set of directed paths such that every vertex v ∈ V belongs to at least one path. Note that a path cover may include paths of length 0 (a single vertex).A path cover may also refer to a vertex-disjoint path cover, i.e., a set of paths such that every vertex v ∈ V belongs to exactly one path.".
- Path_cover label "Path cover".
- Path_cover sameAs Q17141250.
- Path_cover sameAs m.06yqzl.
- Path_cover sameAs Q17141250.
- Path_cover wasDerivedFrom Path_cover?oldid=646020227.
- Path_cover isPrimaryTopicOf Path_cover.