scholarly journals Efficient Parallel Graph Exploration on Multi-Core CPU and GPU

Author(s):  
Sungpack Hong ◽  
Tayo Oguntebi ◽  
Kunle Olukotun

Author(s):  
Michael Burch ◽  
Kiet Bennema ten Brinke ◽  
Adrien Castella ◽  
Ghassen Karray ◽  
Sebastiaan Peters ◽  
...  
Keyword(s):  


Author(s):  
Yuxuan Shi ◽  
Gong Cheng ◽  
Trung-Kien Tran ◽  
Evgeny Kharlamov ◽  
Yulin Shen


Author(s):  
Xin Sui ◽  
Donald Nguyen ◽  
Martin Burtscher ◽  
Keshav Pingali


1993 ◽  
Vol 03 (01) ◽  
pp. 13-18 ◽  
Author(s):  
LIH-HSING HSU

We present an efficient algorithm for computing the matching polynomial of a series-parallel graph in O(n2) time. This algorithm improves on the previous result of O(n3). We also present a cost-optimal parallel algorithm for computing the matching polynomial of a series-parallel graph using an EREW PRAM computer with the number of processors p less than n2/ log n.



Sign in / Sign up

Export Citation Format

Share Document