"Parameterized Algorithms for Max Colorable Induced Subgraph Problem on ..."

Neeldhara Misra et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0431-8

access: closed

type: Journal Article

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/MisraPRRS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/MisraPRRS19
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81(1): 26-46 (2019)

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.