Skip to main content
SpringerLink
Log in

On the Hardness of Reachability Reduction

  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11653))

Included in the following conference series:

  • 895 Accesses

Abstract

A class of reachability reduction problem is raised in the area of computer network security and software engineering. We revisit the reachability reduction problem on vertex labeled graphs in which labels are representing multiple roles. In this paper, reachability reduction is modeled based on a kind of graph cut problem aiming to disconnect those reachable label pairs specified in advance by edge deletion while minimizing the number of pairs have to be disconnected, and followed by some potential applications where our model can be applied. Based on our unified model, we provide a comprehensive complexity analysis of this problem under different conditions, to provide the hardness hierarchy of reachability preserved cut problem. Result in this paper implies that reachability reduction is typically at least harder in directed graph than its undirected counterpart, even beyond \(\mathtt {NP}\) under generalized inputs.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zheng, A.X., Dunagan, J., Kapoor, A.: Active graph reachability reduction for network security and software engineering. In: Twenty-Second International Joint Conference on Artificial Intelligence (2011)

    Google Scholar 

  2. Dunagan, J., Zheng, A.X., Simon, D.R.: Heat-ray: combating identity snowball attacks using machine learning, combinatorial optimization and attack graphs. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 305–320. ACM (2009)

    Google Scholar 

  3. Polevoy, G., Trajanovski, S., Grosso, P., de Laat, C.: Removing undesirable flows by edge deletion. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 217–232. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04651-4_15

    Chapter  Google Scholar 

  4. Folschette, M., Paulevé, L., Magnin, M., Roux, O.: Sufficient conditions for reachability in automata networks with priorities. Theor. Comput. Sci. 608, 66–83 (2015)

    Article  MathSciNet  Google Scholar 

  5. Paulevé, L., Andrieux, G., Koeppl, H.: Under-approximating cut sets for reachability in large scale automata networks. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 69–84. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39799-8_4

    Chapter  Google Scholar 

  6. Buneman, P., Khanna, S., Tan, W.C.: On the propagation of deletions and annotations through views. In: Proceedings of 21st ACM Symposium on Principles of Database Systems, Madison, Wisconsin, pp. 150–158 (2002)

    Google Scholar 

  7. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. In: Gessel, I., Rota, G.C. (eds.) Classic papers in Combinatorics, 243–248. Birkhäuser, Boston (2009)

    Chapter  Google Scholar 

  8. Smith, J.M.: Optimization theory in evolution. Ann. Rev. Ecol. Syst. 9, 31–56 (1978)

    Article  Google Scholar 

  9. Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: 29th Annual Symposium on Foundations of Computer Science, pp. 444–451 (1988)

    Google Scholar 

  10. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 241–251. ACM (1992)

    Google Scholar 

  11. Ausiello, G., Cristiano, F., Laura, L.: Syntactic isomorphism of CNF Boolean formulas is graph isomorphism complete. In: Electronic Colloquium on Computational Complexity, vol. 19, p. 122 (2012)

    Google Scholar 

  12. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Springer, Boston (1972). https://doi.org/10.1007/978-1-4684-2001-2_9

    Chapter  Google Scholar 

  13. Shmoys, D.B.: Cut problems and their application to divide-and-conquer. In: Approximation Algorithms for NP-Hard Problems, pp. 192–235 (1997)

    Google Scholar 

  14. Andreev, K., Racke, H.: Balanced graph partitioning. Theory Comput. Syst. 39, 929–939 (2006)

    Article  MathSciNet  Google Scholar 

  15. Lysgaard, J.: Reachability cuts for the vehicle routing problem with time windows. Eur. J. Oper. Res. 175, 210–223 (2006)

    Article  MathSciNet  Google Scholar 

  16. Chung, F.: Random walks and local cuts in graphs. Linear Algebra Appl. 423, 22–32 (2007)

    Article  MathSciNet  Google Scholar 

  17. Younger, D.: Minimum feedback arc sets for a directed graph. IEEE Trans. Circuit Theory 10, 238–245 (1963)

    Article  Google Scholar 

  18. Guruswami, V., Manokaran, R., Raghavendra, P.: Beating the random ordering is hard: inapproximability of maximum acyclic subgraph. In: 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 573–582. IEEE (2008)

    Google Scholar 

Download references

Acknowledgments

This work is partly supported by the National Natural Science Foundation of China (NSFC) under grant NOs. 61832003, U1811461, 61732003 and the National Science Foundation (NSF) under grant NOs. 1252292, 1741277, 1829674 and 1704287.

Author information

Authors and Affiliations

  1. Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China

    Dongjing Miao

  2. Georgia State University, Atlanta, GA, 30303, USA

    Zhipeng Cai

Authors
  1. Dongjing Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhipeng Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhipeng Cai .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  2. Xidian University, Xi'an, China

    Zhenhua Duan

  3. Xidian University, Xi'an, China

    Cong Tian

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Miao, D., Cai, Z. (2019). On the Hardness of Reachability Reduction. In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26176-4_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26175-7

  • Online ISBN: 978-3-030-26176-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation