scientific article; zbMATH DE number 6783443
zbMATH Open1376.68017MaRDI QIDQ5365091FDOQ5365091
Authors: Colin Cooper, Martin Dyer, Andrew Handley 
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133108
Title of this publication is not available (Why is that?)
Recommendations
- Cycles in random graphs
- scientific article; zbMATH DE number 1953081
- scientific article; zbMATH DE number 775067
- Loops of any size and Hamilton cycles in random scale-free networks
- Random networks with interacting nodes
- Stochastic networks
- The Min Mean-Weight Cycle in a Random Network
- MODELING OF CYCLIC TOPOLOGY IN SCALE-FREE NETWORKS
- On Markovian random networks
- Random graph dynamics
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Network protocols (68M12)
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sampling Regular Graphs and a Peer-to-Peer Network
- Sampling regular graphs and a peer-to-peer network
- Cycles in random meander systems
- Cyclic networks with general blocking and starvation
- The Min Mean-Weight Cycle in a Random Network
- Inducing Measures by Cyclic Networks
- Statistics of cycles: how loopy is your network?
- The flip Markov chain and a randomising P2P protocol
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365091)
