Complex network dimension and path counts
From MaRDI portal
Publication:974738
DOI10.1016/J.TCS.2010.02.013zbMATH Open1207.68172OpenAlexW2050874480MaRDI QIDQ974738FDOQ974738
Authors: O. Shanker
Publication date: 7 June 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.013
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Internet topics (68M11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-state dimension
- The dimensions of individual strings and sequences
- Kolmogorov complexity and Hausdorff dimension
- Title not available (Why is that?)
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Dimension in Complexity Classes
- A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
- GRAPH ZETA FUNCTION AND DIMENSION OF COMPLEX NETWORK
- Fractal dimension and logarithmic loss unpredictability.
- Effective fractal dimensions
- Mathematical Foundations of Computer Science 2005
- DEFINING DIMENSION OF A COMPLEX NETWORK
Cited In (6)
This page was built for publication: Complex network dimension and path counts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974738)