On the Parameterized Complexity of the Maximum Edge Coloring Problem. Goyal, P., Kamat, V., & Misra, N. CoRR, 2013.
On the Parameterized Complexity of the Maximum Edge Coloring Problem [link]Paper  bibtex   
@article{DBLP:journals/corr/GoyalKM13,
  author    = {Prachi Goyal and
               Vikram Kamat and
               Neeldhara Misra},
  title     = {On the Parameterized Complexity of the Maximum Edge Coloring Problem},
  journal   = {CoRR},
  volume    = {abs/1306.2931},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.2931},
  archivePrefix = {arXiv},
  eprint    = {1306.2931},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/GoyalKM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0