Vertex Exponential Algorithms for Connected f-Factors

Philip, Geevarghese; Ramanujan, M. S.

doi:10.4230/LIPIcs.FSTTCS.2014.61

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Vertex Exponential Algorithms for Connected f-Factors

MPS-Authors

/persons/resource/persons71823

Philip, Geevarghese
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2014/4833/
(Any fulltext)

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

Philip, G., & Ramanujan, M. S. (2014). Vertex Exponential Algorithms for Connected f-Factors. In V. Raman, & S. P. Suresh (Eds.), 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (pp. 61-71). Wadern: Schloß Dagstuhl. doi:10.4230/LIPIcs.FSTTCS.2014.61.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-44A5-6

Abstract

There is no abstract available