Automata, Languages and Programming
From MaRDI portal
Publication:5716818
DOI10.1007/11523468zbMath1084.05504OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716818
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (4)
On the cover time and mixing time of random geometric graphs ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Frugal Routing on Wireless Ad-Hoc Networks ⋮ Expander properties and the cover time of random intersection graphs
This page was built for publication: Automata, Languages and Programming
