Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024
Parameterized Complexity of the Star Decomposition Problem
Sahab Hajebi, Ramin Javadi
A star of length is defined as the complete bipartite graph . In this paper we deal with the problem of edge decomposition of graphs into stars of varying l…
cs.CC2021
On the Parameterized Complexity of the Acyclic Matching Problem
Sahab Hajebi, Ramin Javadi
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph…