Abstract
A maximum directed tree size (MDTS) is defined by the maximum number of the vertices of a directed tree on the directed acyclic graph of a given undirected graph. The MDTS of a graph measures the parallelization for the lexicographically first maximal subgraph (LFMS) problems. That is, the complexity of the problems on a graph family \(\mathcal{G}\)gradually increases as the value measured on each graph in the family grows; (1) if the MDTS of each graph in \(\mathcal{G}\)is O(logk n), the lexicographically first maximal independent set problem on \(\mathcal{G}\)is in NC k+1 and the LFMS problem for π is in NC k+S, where π is a property on graphs such that π is nontrivial, hereditary, and NC s−1 testable; (2) both problems above are P-complete if the MDTS of each graph in \(\mathcal{G}\)is cn e. It is worth remarking that the problem to compute the MDTS is in NC 2 this is important in the sense that a “measure” means only if measuring the complexity of a problem is easier than solving the problem.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, L. Babai, and A. Itai. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Journal of Algorithms, 7:567–583, 1986.
Z.-Z. Chen. Personal communication. 1997.
S.A. Cook. A Taxonomy of Problems with Fast Parallel Algorithms. Information and Control, 64:2–22, 1985.
K. Diks, O. Garrido, and A. Lingas. Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings. In ISA '91 Algorithms, pages 385–395. Lecture Notes in Computer Science Vol. 557, Springer-Verlag, 1991.
H. Gazit and L. Miller. An Improved Parallel Algorithm That Computes the BFS Numbering of a Directed Graph. Information Processing Letters, 28:61–65, 1988.
M. Goldberg and T. Spencer. A New Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 18(2):419–427, 1989.
M. Goldberg and T. Spencer. Constructing a Maximal Independent Set in Parallel. SIAM J. Disc. Math., 2(3):322–328, 1989.
R. Greenlaw, H.J. Hoover, and W.L. Ruzzo. Limits to Parallel Computation. Oxford University Press, 1995.
F. Harary. Graph Theory. Addison-Wesley, 1972.
K. Iwama and C. Iwamoto. α-Connectivity: A Gradually Nonparallel Graph Problem. Journal of Algorithms, 20:526–544, 1996.
R.M. Karp and V. Ramachandran. Parallel Algorithms for Shared-Memory Machines. In J. van Leeuwen, editor, The Handbook of Theoretical Computer Science, vol. I: Algorithms and Complexity, pages 870–941. MIT Press, 1990.
R.M. Karp and A. Wigderson. A Fast Parallel Algorithm for the Maximal Independent Set Problem. Journal of American Computing Machinery, 32(4):762–773, 1985.
D.C. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, 1992.
M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15(4):1036–1053, 1986.
S. Miyano. The Lexicographically First Maximal Subgraph Problems: PCompleteness and NC Algorithms. Mathematical Systems Theory, 22:47–73, 1989.
C.H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
D. Pearson and V.V. Vazirani. Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. Journal of Algorithms, 14:171–179, 1993.
T. Shoudai and S. Miyano. Using Maximal Independent Sets to Solve Problems in Parallel. Theoretical Computer Science, 148:57–65, 1995.
S. Toda. Personal communication. 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uehara, R. (1997). A measure of parallelization for the lexicographically first maximal subgraph problems. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024508
Download citation
DOI: https://doi.org/10.1007/BFb0024508
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63757-8
Online ISBN: 978-3-540-69643-8
eBook Packages: Springer Book Archive