An edge coloring of a graph G is to color all the edges in the graph suc...
We contribute the first randomized algorithm that is an integration of
a...
This paper deals with the problem of finding a collection of vertex-disj...
Given a graph, the general problem to cover the maximum number of vertic...
Various new scheduling problems have been arising from practical product...
Given a directed graph G = (V, E), the k-path partition problem is to
fi...
An acyclic edge coloring of a graph G is a proper edge coloring such tha...
Given a simple connected graph G = (V, E), we seek to partition the vert...
Given a set of persistence diagrams P_1,..., P_m, for the data
reduction...
Given a graph G = (V, E), the 3-path partition problem is to find a
mini...
Given a simple graph G = (V, E) and a constant integer k > 2, the
k-path...
A mixed shop is a manufacturing infrastructure designed to process a mix...
Path cover is a well-known intractable problem that finds a minimum numb...