Close category search window
 

A fast NC algorithm to recognize P4-reducible graphs

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

2 Author(s)
Lin, R. ; Dept. of Comput. Sci., State Univ. of New York, Geneseo, NY, USA ; Olariu, S.

A parallel algorithm to recognize P4-reducible graphs and to construct their corresponding tree representation is presented. Terminology and background are given for P4-reducible graphs and the cographs of which they are a natural generalization. The algorithm runs in O(log n) time using O((n2+mn)/log n), where n is the number of vertices and m the number of edges, in the EREW PRAM model. Some open problems are stated

Published in:
Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)

Date of Conference: 22-25 Oct 1990

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.