DocumentCode :
3260284
Title :
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees
Author :
Kim, Sung Kwon
Author_Institution :
Dept. of Comput. Sci. & Eng., Chung-Ang Univ., Seoul, South Korea
fYear :
1997
fDate :
18-20 Dec 1997
Firstpage :
240
Lastpage :
246
Abstract :
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
Keywords :
computational complexity; parallel algorithms; trees (mathematics); EREW PRAM; NP-complete; parallel algorithm; planar mincut; polynomial-time solvable; Computer science; Ear; Joining processes; Parallel algorithms; Phase change random access memory; Polynomials; Tree graphs; Vegetation mapping;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on
Conference_Location :
Taipei
ISSN :
1087-4089
Print_ISBN :
0-8186-8259-6
Type :
conf
DOI :
10.1109/ISPAN.1997.645103
Filename :
645103
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3260284
بازگشت