Triangle counting in large networks: a review

E-ISSN： 1942-4795|8|2|widm.1226-widm.1226

ISSN： 1942-4787

Source： WILEY INTERDISCIPLINARY REVIEWS: DATA MINING AND KNOWLEDGE DISCOVERY (ELECTRONIC), Vol.8, Iss.2, 2018-03, pp. : n/a-n/a

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

Timing conditions for linearizability in uniform counting networks

By Lynch N. Shavit N. Shvartsman A. Touitou D.

Theoretical Computer Science, Vol. 220, Iss. 1, 1999-06 ,pp. : 67-91

Elsevier

Access to resources Recommend Favorite

Sequentially consistent versus linearizable counting networks

By Mavronicolas Marios

Distributed Computing, Vol. 21, Iss. 4, 2008-10 ,pp. : 249-269

Springer Publishing Company

Access to resources Recommend Favorite

MOCUS: moving object counting using ultrasonic sensor networks

By Chen Quanbin Gao Min Ma Jian Zhang Dian Ni Lionel M. Liu Yunhao

International Journal of Sensor Networks, Vol. 3, Iss. 1, 2007-12 ,pp. : 55-65

Inderscience Publishers

Access to resources Recommend Favorite

Estimation algorithm for counting periodic orbits in complex social networks

By Sorkhoh Ibrahim

Information Systems Frontiers, Vol. 15, Iss. 2, 2013-04 ,pp. : 193-202

Springer Publishing Company

Access to resources Recommend Favorite

The complexity of latching transitions in large scale cortical networks

By Kropff Emilio Treves Alessandro

Natural Computing, Vol. 6, Iss. 2, 2007-06 ,pp. : 169-185

Springer Publishing Company

Access to resources Recommend Favorite