default search action

combined dblp search
author search
venue search
publication search

ask others

"Parameterized Complexity of Maximum Edge Colorable Subgraph."

Akanksha Agrawal et al. (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-58150-3_50

access: closed

type: Conference or Workshop Paper

metadata version: 2024-01-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/AgrawalKS0T20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/AgrawalKS0T20
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON 2020: 615-626

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.