English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph

MPS-Authors
/persons/resource/persons44373

Eisenbrand,  Friedrich
Discrete Optimization, MPI for Informatics, Max Planck Society;

/persons/resource/persons44464

Funke,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44477

Garg,  Naveen
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44808

Könemann,  Jochen
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Eisenbrand, F., Funke, S., Garg, N., & Könemann, J. (2003). A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03) (pp. 517-522). New York, NY: ACM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2BE7-0
Abstract
There is no abstract available