( en | de | ru )

 

Disambiguation of "Fushimi, Takayasu"

Author of the publication

copydeleteadd this publication to your clipboard
A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity.

, , , and . COMPLEX NETWORKS (1), volume 812 of Studies in Computational Intelligence, page 3-14. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Miriam Takayasu

Takayasu Shimizu

 

Other publications of authors with the same name

Graph generation method based on relative value of neighbor edges., , and . iiWAS, page 358-365. ACM, (2017)A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity., , , and . COMPLEX NETWORKS (1), volume 812 of Studies in Computational Intelligence, page 3-14. Springer, (2018)Stimulation Index of Cascading Transmission in Information Diffusion over Social Networks., , and . COMPLEX NETWORKS (1), volume 943 of Studies in Computational Intelligence, page 469-481. Springer, (2020)Audience Prediction for Game Streaming Channels Based on Vectorization of User Comments., and . DS, volume 14276 of Lecture Notes in Computer Science, page 81-95. Springer, (2023)Estimating Network Structure from Anonymous Ego-centric Information., , and . PKAW, volume 8863 of Lecture Notes in Computer Science, page 236-245. Springer, (2014)Functional cluster extraction from large spatial networks., , , and . ASONAM, page 57-62. IEEE Computer Society, (2016)Improving approximate extraction of functional similar regions from large-scale spatial networks based on greedy selection of representative nodes of different areas., , , and . Appl. Netw. Sci., 3 (1): 18:1-18:14 (2018)Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-Links., , , , and . DS, volume 12323 of Lecture Notes in Computer Science, page 421-436. Springer, (2020)Growth Analysis of Purchase History Graph Based on Relative Value of Edge Multiplicity., , and . iiWAS, page 65-69. ACM, (2018)High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix., and . COMPLEX NETWORKS, volume 1016 of Studies in Computational Intelligence, page 536-548. Springer, (2021)