"A combinatorial algorithm for computing a maximum independent set in a ..."

Friedrich Eisenbrand et al. (2003)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2018-02-14

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/EisenbrandFGK03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/EisenbrandFGK03
Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann:
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. SODA 2003: 517-522

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.