English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On Tree-constrained Matchings and Generalizations

MPS-Authors
/persons/resource/persons44218

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

/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44788

Klau,  Gunnar W.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45030

Mestre,  Julian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Canzar, S., Elbassioni, K., Klau, G. W., & Mestre, J. (2011). On Tree-constrained Matchings and Generalizations. In L. Aceto, M. Henzinger, & J. Sgall (Eds.), Automata, Languages and Programming (pp. 98-109). Berlin: Springer. doi:10.1007/978-3-642-22006-7_9.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-1274-3
Abstract
There is no abstract available