Login / Signup
On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem.
Alessandro Aloisio
Vahan Mkrtchyan
Published in:
CoRR (2019)
Keyphrases
</>
np hard
weighted graph
social networks
multi agent
search space
edge weights
fixed parameter tractability