2 research outputs found
On maximum -edge-colorable subgraphs of bipartite graphs
If , then a -edge-coloring of a graph is an assignment of
colors to edges of from the set of colors, so that adjacent edges
receive different colors. A -edge-colorable subgraph of is maximum if it
is the largest among all -edge-colorable subgraphs of . For a graph
and , let be the number of edges of a maximum
-edge-colorable subgraph of . In 2010 Mkrtchyan et al. proved that if
is a cubic graph, then . This result
implies that if the cubic graph contains a perfect matching, in particular
when it is bridgeless, then . One may
wonder whether there are other interesting graph-classes, where a relation
between and can be proved. Related
with this question, in this paper we show that for any bipartite graph ,
and .Comment: 11 pages, 1 figur
Assigning tasks to agents under time conflicts: a parameterized complexity approach
We consider the problem of assigning tasks to agents under time conflicts,
with applications also to frequency allocations in point-to-point wireless
networks. In particular, we are given a set of agents, a set of
tasks, and different time slots. Each task can be carried out in one of the
predefined time slots, and can be represented by the subset
of the involved agents. Since each agent cannot participate to more than one
task simultaneously, we must find an allocation that assigns non-overlapping
tasks to each time slot. Being the number of slots limited by , in general
it is not possible to executed all the possible tasks, and our aim is to
determine a solution maximizing the overall social welfare, that is the number
of executed tasks. We focus on the restriction of this problem in which the
number of time slots is fixed to be , and each task is performed by
exactly two agents, that is . In fact, even under this assumptions, the
problem is still challenging, as it remains computationally difficult. We
provide parameterized complexity results with respect to several reasonable
parameters, showing for the different cases that the problem is fixed-parameter
tractable or it is paraNP-hard.Comment: 31 pages, 3 figure