Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17141250> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q17141250 subject Q6465276.
- Q17141250 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.".
- Q17141250 wikiPageExternalLink dbook.
- Q17141250 wikiPageExternalLink graph.theory.
- Q17141250 wikiPageExternalLink abs_all.jsp?arnumber=1702662.
- Q17141250 wikiPageExternalLink 1761.html.
- Q17141250 wikiPageWikiLink Q1060343.
- Q17141250 wikiPageWikiLink Q1134776.
- Q17141250 wikiPageWikiLink Q1137554.
- Q17141250 wikiPageWikiLink Q1137726.
- Q17141250 wikiPageWikiLink Q1415372.
- Q17141250 wikiPageWikiLink Q215206.
- Q17141250 wikiPageWikiLink Q273037.
- Q17141250 wikiPageWikiLink Q5179248.
- Q17141250 wikiPageWikiLink Q6465276.
- Q17141250 wikiPageWikiLink Q781585.
- Q17141250 wikiPageWikiLink Q987652.
- Q17141250 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.".
- Q17141250 label "Path cover".