Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Directed graphHamiltonian pathHamiltonian path problemIndependent set (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Hydras: Complexity on general graphs and a subclass of trees
2013
2013
The 2-path-bipanconnectivity of hypercubes
2012
2012
Character design and stamp algorithms for Character Projection Electron-Beam Lithography
In this paper, we propose a series of methods, including character design, stencil compaction and layout matching for Character… 
2010
2010
A dynamic heuristic algorithm for offset assignment
Optimization of the program to be stored in ROM in the microprocessor is an important issue in compiling for embedded processors… 
2008
2008
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins… 
2008
2008
A certifying algorithm for the path cover problem on interval graphs
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The… 
2008
2008
Optimal Path Cover for Graphs of Small Treewidth
This paper studies the optimal path cover problem in graphs of small treewidth. Let G=(V, E) be a graph modeled by network with… 
2006
2006
On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes
Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most… 
2006
2006
Vertex covering by paths on trees with its applications in machine translation
1992
1992
An efficient EREW algorithm for minimum path cover and Hamiltonicity on cographs
It is shown that the notoriously difficult problem of finding the minimum number of paths that cover the vertices of a graph can… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)