Quasi-randomness and algorithmic regularity for graphs with general degree distributions

Noga Alon, Amin Coja-Oghlan, Hiep Hàn, Mihyun Kang, Vojtech Rödl, Michael Schacht

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationAutomata, Languages and Programming
Place of PublicationBerlin; Heidelberg
PublisherSpringer
Pages789-800
Volume4596
ISBN (Print)978-3-540-73420-8
DOIs
Publication statusPublished - 2007
EventInternational Colloquium on Automata, Languages and Programming - Wroclaw, Poland
Duration: 9 Jul 200713 Jul 2007

Publication series

NameLecture notes in computer science
PublisherSpringer

Conference

ConferenceInternational Colloquium on Automata, Languages and Programming
CountryPoland
CityWroclaw
Period9/07/0713/07/07

Fields of Expertise

  • Sonstiges

Cite this

Alon, N., Coja-Oghlan, A., Hàn, H., Kang, M., Rödl, V., & Schacht, M. (2007). Quasi-randomness and algorithmic regularity for graphs with general degree distributions. In Automata, Languages and Programming (Vol. 4596, pp. 789-800). (Lecture notes in computer science). Berlin; Heidelberg: Springer. https://doi.org/10.1007/978-3-540-73420-8_68