Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,938 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Directed graph
Hamiltonian path
Hamiltonian path problem
Independent set (graph theory)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games
A. Ćustić
,
Stefan Lendl
arXiv.org
2018
Corpus ID: 3635543
We introduce a simplified model for platform game levels with falling platforms based on interval graphs and show that…
Expand
2018
2018
The Disjoint Path Covers of Two-Dimensional Torus Networks
Di Liu
,
Jing Li
,
Shurong Zuo
15th International Symposium on Pervasive Systems…
2018
Corpus ID: 59619837
Two-dimensional torus network has been widely applied in large-scale network topology distribution systems. This paper considered…
Expand
2014
2014
Mobile relay deployment based on Markov chains in WiMAX networks
Zhuofan Liao
,
Xi Zhang
,
Chaochao Feng
IEEE Global Communications Conference
2014
Corpus ID: 21237861
In WiMAX networks with fixed relay stations (FRSs), mobile users move in and out of the coverage area of FRS in different periods…
Expand
2013
2013
{em, vk }-Cyclic Path Covering Number of Digraphs
G. Rajasekar
2013
Corpus ID: 124375790
In this paper we state a definition of vk - Cyclic path covering to find the Cyclic path covering number of a digraph in which…
Expand
2012
2012
Many-to-Many Disjoint Path Covers in Two-Dimensional Bipartite Tori with a Single Vertex Fault
김호동
,
Jung-Heum Park
2012
Corpus ID: 18079785
A paired many-to-many -disjoint path cover (-DPC for short) of a graph is a set of disjoint paths joining distinct source…
Expand
2011
2011
One-to-one Disjoint Path Cover of Tori
Hee-Chul Kim
2011
Corpus ID: 123654470
Let u and be any two vertices of a graph G and k be a positive integer. A vertex disjoint k-path cover between u and is a set of…
Expand
2009
2009
Paired Many-to-Many Disjoint Path Covers in Recursive Circulants and Tori
E. Kim
,
Jung-Heum Park
2009
Corpus ID: 15524642
A paired many-to-many k-disjoint path cover (paired k-DPC) of a graph G is a set of k disjoint paths joining k distinct source…
Expand
2009
2009
Graphoidal Tree d - Cover
S. Somasundaram
,
A. Nagarajan
,
G. Mahadevan
2009
Corpus ID: 2417298
In (1) Acharya and Sampathkumar defined a graphoidal cover as a partition of edges into internally disjoint (not necessarily open…
Expand
2008
2008
A certifying algorithm for the path cover problem on interval graphs
Maw-Shang Chang
2008
Corpus ID: 17716280
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The…
Expand
2006
2006
Strengthening Cover Inequalities for Area-Based Adjacency Formulations of Harvest Scheduling Models
Sándor F. Tóth
,
M. McDill
,
S. George
2006
Corpus ID: 7107115
Spatially-explicit harvest scheduling models optimize the spatial and temporal layout of forest management actions in order to…
Expand