Identifying sparse and dense sub-graphs in large graphs with a fast algorithm

Author： Fioriti Vincenzo   Chinnici Marta  

Publisher： Edp Sciences

E-ISSN： 1286-4854|108|5|50006-50006

ISSN： 0295-5075

Source： EPL (EUROPHYSICS LETTERS), Vol.108, Iss.5, 2014-12, pp. : 50006-50006

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Sudden emergence of $q$-regular subgraphs in random graphs

By  

EPL (EUROPHYSICS LETTERS), Vol. 75, Iss. 1, 2006-07 ,pp. : 8-14

Edp Sciences

Access to resources Recommend Favorite

The asymptotics of large constrained graphs

By Radin Charles   Ren Kui   Sadun Lorenzo  

Journal of Physics A: Mathematical and Theoretical, Vol. 47, Iss. 17, 2014-05 ,pp. : 175001-175020

IOP Publishing

Access to resources Recommend Favorite

Computing the Eccentricity Distribution of Large Graphs

By Takes Frank W.   Kosters Walter A.  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 100-118

MDPI

Access to resources Recommend Favorite

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

By Cuzzocrea Alfredo   Cosulschi Mirel   de Virgilio Roberto  

Algorithms, Vol. 9, Iss. 1, 2016-01 ,pp. : 7-7

MDPI

Access to resources Recommend Favorite

A fast sparse reconstruction algorithm for electrical tomography

By Zhao Jia   Xu Yanbin   Tan Chao   Dong Feng  

Measurement Science and Technology, Vol. 25, Iss. 8, 2014-08 ,pp. : 85401-85414

IOP Publishing

Access to resources Recommend Favorite