| http://dbpedia.org/ontology/abstract
|
Given a directed graph G = (V, E), a path … 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. vertex v ∈ V belongs to exactly one path.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/ +
, https://walkccc.me/CLRS/Chap26/Problems/26-2/ +
, http://www.austms.org.au/Publ/Jamsb/V44P2/1761.html +
, http://www.cs.rhul.ac.uk/books/dbook/ +
|
| http://dbpedia.org/ontology/wikiPageID
|
2243546
|
| http://dbpedia.org/ontology/wikiPageLength
|
3248
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1122022144
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Directed_path +
, http://dbpedia.org/resource/Matching_%28graph_theory%29 +
, http://dbpedia.org/resource/NP-hard +
, http://dbpedia.org/resource/Covering_%28disambiguation%29 +
, http://dbpedia.org/resource/Directed_graph +
, http://dbpedia.org/resource/NP-complete +
, http://dbpedia.org/resource/Hamiltonian_path +
, http://dbpedia.org/resource/Dilworth%27s_theorem +
, http://dbpedia.org/resource/Category:Graph_theory_objects +
, http://dbpedia.org/resource/P_%28complexity%29 +
, http://dbpedia.org/resource/ANZIAM_Journal +
, http://dbpedia.org/resource/Independent_set_%28graph_theory%29 +
, http://dbpedia.org/resource/Hamiltonian_path_problem +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Citation +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Graph_theory_objects +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Set +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Path_cover?oldid=1122022144&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Path_cover +
|
| owl:sameAs |
https://global.dbpedia.org/id/ge4E +
, http://yago-knowledge.org/resource/Path_cover +
, http://dbpedia.org/resource/Path_cover +
, http://www.wikidata.org/entity/Q17141250 +
, http://rdf.freebase.com/ns/m.06yqzl +
|
| rdf:type |
http://dbpedia.org/class/yago/PhysicalEntity100001930 +
, http://dbpedia.org/class/yago/WikicatGraphTheoryObjects +
, http://dbpedia.org/class/yago/Object100002684 +
|
| rdfs:comment |
Given a directed graph G = (V, E), a path … 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. vertex v ∈ V belongs to exactly one path.
|
| rdfs:label |
Path cover
|
