Estimating graph distance and centrality on shared nothing architectures

E-ISSN： 1532-0634|27|14|3587-3613

ISSN： 1532-0626

Source： CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol.27, Iss.14, 2015-09, pp. : 3587-3613

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

Models for Control Unit Synchronization on Shared Control Architectures

By Abu-Ghazaleh N.B. Wilsey P.A.

Journal of Parallel and Distributed Computing, Vol. 52, Iss. 1, 1998-07 ,pp. : 69-81

Academic Press

Access to resources Recommend Favorite

Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph

By Guo Dan

Applied Intelligence, Vol. 39, Iss. 1, 2013-07 ,pp. : 57-74

Springer Publishing Company

Access to resources Recommend Favorite

Efficient shared-memory support for parallel graph reduction

By Bennett A.J. Kelly P.H.J.

Future Generation Computer Systems, Vol. 12, Iss. 6, 1997-06 ,pp. : 481-503

Elsevier

Access to resources Recommend Favorite

Distance Transform Algorithm for Bit-Serial SIMD Architectures

By Takala J.H. Viitanen J.O.

Computer Vision and Image Understanding, Vol. 74, Iss. 2, 1999-05 ,pp. : 150-161

Academic Press

Access to resources Recommend Favorite

Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors

By Chen Ying Dehne Frank Eavis Todd Rau-Chaplin Andrew

Distributed and Parallel Databases, Vol. 15, Iss. 3, 2004-05 ,pp. : 219-236

Springer Publishing Company

Access to resources Recommend Favorite