Access Restriction

Author Caceres, E. ♦ Chan, A. ♦ Dehne, F. ♦ Prencipe, G.
Source CiteSeerX
Content type Text
Publisher Springer
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Parallel Algorithm ♦ Detecting Convex Bipartite Graph ♦ Synchronous Parallel Computer ♦ Bipartite Graph ♦ Graph Problem ♦ Algorithm Require
Description In 26th Workshop on GraphTheoretic Concepts in Computer Science (WG 2000), volume 1928 of Lecture Notes in Computer Science
In this paper, we present parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel computer (BSP) for solving two well known graph problems: (1) determining whether a graph G is bipartite, and (2) determining whether a bipartite graph G is convex. Our algorithms require O(...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1928-01-01