The lexicographically first maximal subgraph problems: P-completeness and NC algorithms

  • Satoru Miyano
Algorithms And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)


The P-completeness of the lexicographically first maximal (l.f.m.) subgraph problem for any nontrivial hereditary property is proved. If the instances are restricted to graphs with degree at most 3, the l.f.m. 4-cycle free subgraph problem is shown to be in NC2. This degree constraint 3 is best possible.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AT]
    T. Asano and T. Hirata, Edge-deletion and edge-contraction problems, Proc. 14th ACM STOC (1982) 245–254.Google Scholar
  2. [C1]
    S.A. Cook, An observation on time-storage trade off, J. Comput. System Sci. 9 (1974) 308–316.Google Scholar
  3. [C2]
    S.A. Cook, A taxonomy of problems with fast parallel algorithms, Inform. Contr. 64 (1985) 2–22.Google Scholar
  4. [GJ]
    M.R. Garey and D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math. 32 (1977) 826–834.CrossRefGoogle Scholar
  5. [Go]
    L.M. Goldschlager, The monotone and planar circuit value problems are log space complete for P, SIGACT News 9 (1977) 25–29.CrossRefGoogle Scholar
  6. [JV]
    D.B. Johnson and S.M. Venkatesan, Parallel algorithm for minimum cuts and maximum flows in planar networks, Proc. 22nd IEEE FOCS (1982) 244–254.Google Scholar
  7. [KUW]
    R.M. Karp, E. Upfal and A. Wigderson, Constructing a perfect matching is in random NC, Proc. 17th ACM STOC (1985) 22–32.Google Scholar
  8. [La]
    R.E. Ladner, The circuit value problem is log-space complete for P, SIGACT News 7 (1975) 18–20.CrossRefGoogle Scholar
  9. [LY]
    J.M. Lewis and M. Yannakakis, The node deletion problems for hereditary properties is NP-complete, J. Comput. System Sci. 20 (1980) 219–230.Google Scholar
  10. [Lu]
    M. Luby, A simple parallel algorithm for the maximal independent set problem, Proc. 17th ACM STOC (1985) 1–10.Google Scholar
  11. [S]
    E. Speckenmeyer, Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen, Ph.D. Thesis, Universität Paderborn, 1983.Google Scholar
  12. [WAN]
    T. Watanabe, T. Ae and A. Nakamura, On the removal of forbidden graphs by edge-deletion or by edge-contraction, Discrete Appl. Math. 3 (1981) 151–153.Google Scholar
  13. [Y]
    M. Yannakakis, Node-deletion problems on bipartite graphs, SIAM J. Comput. 10 (1981) 310–327.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Satoru Miyano
    • 1
    • 2
  1. 1.FB 17, Mathematik-InformatikUniversität PaderbornPaderbornWest Germany
  2. 2.Department of MathematicsKyushu University 33FukuokaJapan

Personalised recommendations