Ordered h-Level Graphs on the BSP Model

Author： Gerbessiotis A.V.   Siniolakis C.J.  

Publisher： Academic Press

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.49, Iss.1, 1998-02, pp. : 98-110

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

A programming model for BSP with partitioned synchronisation

By Stewart Alan  

Formal Aspects of Computing, Vol. 23, Iss. 4, 2011-07 ,pp. : 421-432

Springer Publishing Company

Access to resources Recommend Favorite

The core of games on ordered structures and graphs

By Grabisch Michel  

Annals of Operations Research, Vol. 204, Iss. 1, 2013-04 ,pp. : 33-64

Springer Publishing Company

Access to resources Recommend Favorite

Using the BSP cost model to optimise parallel neural network training

By Rogers R.O.   Skillicorn D.B.  

Future Generation Computer Systems, Vol. 14, Iss. 5, 1998-12 ,pp. : 409-424

Elsevier

Access to resources Recommend Favorite

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model

By Baumker A.   Dittrich W.   auf der Heide F.M.  

Theoretical Computer Science, Vol. 203, Iss. 2, 1998-08 ,pp. : 175-203

Elsevier

Access to resources Recommend Favorite

Using the Minimum Description Length Principle to Infer Reduced Ordered Decision Graphs

By Oliveira A.L.  

Machine Learning, Vol. 25, Iss. 1, 1996-10 ,pp. : 23-50

Springer Publishing Company

Access to resources Recommend Favorite