Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Shortest Path Approximate Algorithm for Complex Network Analysis

From MaRDI portal
Publication:2917146
Jump to:navigation, search

DOI10.3724/SP.J.1001.2011.03924zbMath1265.68357OpenAlexW2333683078MaRDI QIDQ2917146

Ting Wang, Ji Wang, Jintao Tang

Publication date: 5 October 2012

Published in: Journal of Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1001.2011.03924


zbMATH Keywords

approximation algorithmsocial networksshortest path problemnetwork property


Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25)







This page was built for publication: Shortest Path Approximate Algorithm for Complex Network Analysis

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2917146&oldid=15890781"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki