Skip to main content
SpringerLink
Log in

Δ p2 -complete lexicographically first maximal subgraph problems

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

Abstract

The lexicographically first maximal (lfm) induced path problem is shown Δ p2 -complete. The lfm rooted tree problem is also δ p2 -complete. But when restricted to topologically sorted directed acyclic graphs (dags), the lfm rooted tree problem allows a polynomial time algorithm. Moreover, the problem restricted dags with degree 3 is shown in NC2 while the problem for degree 4 is P-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, R. and Mayr, E.W., Parallelism and the maximal path problem, Inf. Process. Lett. 24 (1987) 121–124.

    Google Scholar 

  2. Berge, C., Graphes et hypergraphes, Dunod, 1970.

    Google Scholar 

  3. Garey, M.R., Johnson, D.S. and Tarjan, R.E., The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput. 5 (1976) 704–714.

    Google Scholar 

  4. Goldschlager, L.M., The monotone and planar circuit value problems are log space complete for P, SIGACT News 9 (1977) 25–29.

    Google Scholar 

  5. Lewis, J.M. and Yannakakis, M., The node deletion problems for hereditary properties is NP-complete, J. Comput. System Sci. 20 (1980) 219–230.

    Google Scholar 

  6. Martel, C.U., Lower bounds on parallel algorithms for finding the first maximal independent set, Inf. Process. Lett. 22 (1986) 81–85.

    Google Scholar 

  7. Miyano, S., The lexicographically first maximal subgraph problems: P-completeness and NC algorithms, Proc. 14th ICALP (LNCS 267)(1987) 425–434.

    Google Scholar 

  8. Miyano, S., A parallelizable lexicographically first maximal edge-induced subgraph problem, Inf. Process. Lett. 29 (1988) 75–78.

    Google Scholar 

  9. Papadimitriou, C.H., On the complexity of unique solution, J. Assoc. Comput. Mach. 31 (1984) 392–400.

    Google Scholar 

  10. Wagner, K.W., More complicated questions about maxima and minima, and some closure of NP, Proc. 13th ICALP (LNCS 226)(1986) 434–443.

    Google Scholar 

  11. Yannakakis, M., The effect of a connectivity requirement on the complexity of maximum subgraph problems, J. Assoc. Comput. Mach. 26 (1979) 618–630.

    Google Scholar 

  12. Yannakakis, M., Node-deletion problems on bipartite graphs, SIAM J. Comput. 10 (1981) 310–327.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute of Fundamental Information Science, Kyushu University 33, 812, Fukuoka, Japan

    Satoru Miyano

Authors
  1. Satoru Miyano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miyano, S. (1988). Δ p2 -complete lexicographically first maximal subgraph problems. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017168

Download citation

  • DOI: https://doi.org/10.1007/BFb0017168

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation