"Solving coloring, minimum clique cover and kernel problems on arc ..."

Olivier Durand de Gevigney et al. (2011)

> Home

Details and statistics

DOI: 10.1007/S10288-010-0150-8

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/4or/GevigneyMPRR11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/4or/GevigneyMPRR11
Olivier Durand de Gevigney, Frédéric Meunier, Christian Popa, Julien Reygner, Ayrin Romero:
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree. 4OR 9(2): 175-188 (2011)

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.