English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Complexity of Computing the Anti-Ramsey Numbers for Paths

MPS-Authors
/persons/resource/persons255170

Roghani,  Mohammad
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons251338

Shahkarami,  Golnoosh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons255172

Soltani,  Reza
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons255174

Vahidi,  Hossein
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Amiri, S. A., Popa, A., Roghani, M., Shahkarami, G., Soltani, R., & Vahidi, H. (2020). Complexity of Computing the Anti-Ramsey Numbers for Paths. In J. Esparza, & D. Kràl' (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.MFCS.2020.6.


Cite as: http://hdl.handle.net/21.11116/0000-0007-9422-B
Abstract
There is no abstract available