Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs

Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan

doi:10.4230/LIPIcs.SWAT.2016.14

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs

MPS-Authors

/persons/resource/persons98374

van Leeuwen, Erik Jan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2016/6036/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

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

Kanj, I., Komusiewicz, C., Sorge, M., & van Leeuwen, E. J. (2016). Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. In R. Pagh (Ed.), 15th Scandinavian Symposium and Workshops on Algorithm Theory (pp. 1-14). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SWAT.2016.14.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-5367-9

Abstract

There is no abstract available