# Path cover

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- MEMICS
- 2016

Graph Hamiltonian properties are studied especially in connection with graph connectivity properties. A graph is called… (More)

Is this relevant?

2016

2016

- CIKM
- 2016

A metric-independent data structure for spatial networks called k-all-path cover (k-APC) has recently been proposed. It involves… (More)

Is this relevant?

2013

2013

- Discrete Applied Mathematics
- 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)

Is this relevant?

2009

2009

- Algorithmica
- 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)

Is this relevant?

2008

2008

- SWAT
- 2008

We develop a path cover technique to solve lowest common ancestor (LCA for short) problems in a directed acyclic graph (dag). Our… (More)

Is this relevant?

2008

2008

- Fourth International Conference on Networked…
- 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)

Is this relevant?

2006

2006

- Theor. Comput. Sci.
- 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)

Is this relevant?

1993

1993

- Theor. Comput. Sci.
- 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)

Is this relevant?

1990

1990

- Journal of Graph Theory
- 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)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- IEEE Transactions on Software Engineering
- 1979

In this paper various path cover problems, arising in program testing, are discussed. Dilworth's theorem for acyclic digraphs is… (More)

Is this relevant?