NDLI: Parallel algorithms for maximal acyclic sets

Content Provider	IEEE Xplore Digital Library
Author	Zhi-Zhong Chen Xin He
Copyright Year	1995
Description	Author affiliation: Dept. of Math. Sci., Tokyo Denki Univ., Saitama, Japan (Zhi-Zhong Chen)
Abstract	Given a graph G=(V, E), the classical spanning forest problem of G can be viewed as the problem of finding a maximal subset F of E inducing an acyclic subgraph. Although it is well known that this problem has efficient NC algorithms, its vertex counterpart, i.e., the problem of finding a maximal subset U of V inducing an acyclic subgraph, has not been shown to be in NC (or even in RNC) and is not believed to be parallelizable in general. We present NC algorithms for solving the latter problem for three special cases. The first algorithm solves the problem for planar graphs in O(log/sup 3/ n) time using O(n) processors on an EREW PRAM. The second algorithm solves the problem for K/sub 3,3/-free graphs in O(log/sup 4/ n) time using O(n) processors on an EREW PRAM. The third algorithm solves the problem for graphs without long induced paths in poly-logarithmic time using O(n/sup 2376/) processors on an EREW PRAM.
Starting Page	169
Ending Page	175
File Size	645540
Page Count	7
File Format	PDF
ISBN	081867038X
DOI	10.1109/AISPAS.1995.401341
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-03-15
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parallel algorithms Algorithm design and analysis Approximation algorithms Phase change random access memory Helium Computer science NP-hard problem Concurrent computing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in