Path cover

Known as: Minimum path cover 
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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Graph Hamiltonian properties are studied especially in connection with graph connectivity properties. A graph is called… (More)
Is this relevant?
2016
2016
A metric-independent data structure for spatial networks called k-all-path cover (k-APC) has recently been proposed. It involves… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
A subset S of vertices of a graph G is called a vertex k-path cover if every path of order k in G contains at least one vertex… (More)
  • figure 2
Is this relevant?
2009
2009
We consider a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short, on interval… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
We develop a path cover technique to solve lowest common ancestor (LCA for short) problems in a directed acyclic graph (dag). Our… (More)
  • figure 2
Is this relevant?
2008
2008
This paper studies the optimal path cover problem in graphs of small treewidth. Let G=(V, E) be a graph modeled by network with… (More)
  • figure 1
  • table 1
Is this relevant?
2006
2006
In this paper we investigate the k-path cover problem for graphs, which is to find the minimum number of vertex disjoint k-paths… (More)
  • figure 1
  • figure 2
Is this relevant?
1993
1993
The optimal path cover problem is to find a minimum number of vertex disjoint paths which together cover all the vertices of the… (More)
  • figure 1
Is this relevant?
1990
1990
A perfect path double cover (PPDC) of a graph G on n vertices is a family 9 of n paths of G such that each edge of G belongs to… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1979
Highly Cited
1979
In this paper various path cover problems, arising in program testing, are discussed. Dilworth's theorem for acyclic digraphs is… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 6
Is this relevant?