IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Journals & Magazines > Computers, IEEE Transactions ...> Volume:37 Issue:10 Help

NC algorithms for recognizing chordal graphs and k trees

Full Text Sign-In or Purchase

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)
Chandrasekharan, N. ; Dept. of Math. Sci., Clemson Univ., SC, USA ; Iyengar, S.S.

The authors present parallel algorithms for recognizing the chordal graphs and k trees. Under the PRAM (parallel random-access-machine) model of computation with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n4) processors. The algorithms have a better processor bound than an independent result by A. Edenbrandt (1985) for recognizing chordal graphs in parallel using O(n3m) processors

Published in:
Computers, IEEE Transactions on  (Volume:37 ,  Issue: 10 )

Date of Publication: Oct 1988

Page(s):
1178 - 1183
ISSN :
0018-9340
INSPEC Accession Number:
3300023
Digital Object Identifier :
10.1109/12.5979
Product Type:
Journals & Magazines
Date of Current Version :
06 August 2002
Issue Date :
Oct 1988
Sponsored by :
IEEE Computer Society

IEEE Account

Purchase Details

Profile Information

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.