Path cover
id:
path-cover-304-11913633
title:
Path cover
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Path_cover
date created:
date modified:
2022-11-15T12:18:09Z
main entity:
{"identifier":"Q17141250","url":"https://www.wikidata.org/entity/Q17141250"}
image:
fields total:
13
integrity:
13