Cart (Loading....) | Create Account
Close category search window

A provably fastest parallel algorithm for the recognition of the consecutive ones property with selected applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lin Chen ; FRL, Los Angeles, CA, USA

Presented here is a parallel algorithm that decides if an m×n (0, 1)-matrix has the consecutive 1's property for rows, and if so, turns the matrix into one with consecutive 1's in each row by column permutation. The algorithm runs in optimal O(log(mn)) time with O(M(m)n log m/m+M(n)m2 log n/n2) work on CREW PRAM where M(n) denotes the processor bound for multiplying two n×n matrices in O(log n) time and is o(n2.376). We then show that this procedure can recognize doubly convex bipartite graphs in O(log n) time with O(M(n)) processors

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.