English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

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 Resource

https://drops.dagstuhl.de/opus/volltexte/2020/12678/
(Publisher version)

https://creativecommons.org/licenses/by/3.0/legalcode
(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

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: https://hdl.handle.net/21.11116/0000-0007-9422-B
Abstract
There is no abstract available