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 Conference Publications > Parallel Architectures, Algor ... Help

An efficient parallel algorithm for the planar mincut linear arrangement problem for 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

1 Author(s)
Sung Kwon Kim ; Dept. of Comput. Sci. & Eng., Chung-Ang Univ., Seoul, South Korea

The MINCUT problem for graphs is to find a linear arrangement with minimum cut. The problem is NP-complete for general graphs while polynomial-time solvable for trees. The PLANAR MINCUT problem does not allow edge crossings in arrangements. We present a parallel algorithm for the PLANAR MINCUT problem for trees with n vertices, which takes O(log2 n) time and O(n) processors in the EREW PRAM

Published in:
Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Date of Conference: 18-20 Dec 1997

Page(s):
240 - 246
Meeting Date :
18 Dec 1997-20 Dec 1997
ISSN :
1087-4089
Print ISBN:
0-8186-8259-6
INSPEC Accession Number:
5816497
Conference Location :
Taipei
Digital Object Identifier :
10.1109/ISPAN.1997.645103
Product Type:
Conference Publications

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.