Skip to main content
SpringerLink
Log in

More Routes for Evacuation

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

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

Included in the following conference series:

Abstract

In this paper, we consider the problem of enumerating spanning subgraphs with high edge-connectivity of an input graph. Such subgraphs ensure multiple routes between two vertices. We first present an algorithm that enumerates all the \(2\)-edge-connected spanning subgraphs of a given plane graph with n vertices. The algorithm generates each \(2\)-edge-connected spanning subgraph of the input graph in \({\text {O}}(n)\) time. We next present an algorithm that enumerates all the \(k\)-edge-connected spanning subgraphs of a given general graph with m edges. The algorithm generates each \(k\)-edge-connected spanning subgraph of the input graph in \({\text {O}}(mT)\) time, where T is the running time to check the k-edge-connectivity of a graph.

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. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1–3), 21–46 (1996)

    Article  MathSciNet  Google Scholar 

  2. Birmelé, E., Ferreira, R., Grossi, R., Marino, A., Pisanti, N., Rizzi, R., Sacomoto, G.: Optimal listing of cycles and st-paths in undirected graphs. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1884–1896, January 2012

    Chapter  Google Scholar 

  3. Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K., Rudolf, G.: Generating minimal \(k\)-vertex connected spanning subgraphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 222–231. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73545-8_23

    Chapter  Google Scholar 

  4. Conte, A., Kanté, M.M., Otachi, Y., Uno, T., Wasa, K.: Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 150–161. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62389-4_13

    Chapter  Google Scholar 

  5. Conte, A., Virgilio, R.D., Maccioni, A., Patrignani, M., Torlone, R.: Finding all maximal cliques in very large social networks. In: Proceedings of the 19th International Conference on Extending Database Technology, pp. 173–184 (2016)

    Google Scholar 

  6. Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K.: Enumerating spanning and connected subsets in graphs and matroids. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 444–455. Springer, Heidelberg (2006). https://doi.org/10.1007/11841036_41

    Chapter  Google Scholar 

  7. Kurita, K., Wasa, K., Uno, T., Arimura, H.: Efficient enumeration of induced matchings in a graph without cycles with length four. CoRR, abs/1707.02740 (2017)

    Google Scholar 

  8. Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260–272. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27810-8_23

    Chapter  Google Scholar 

  9. Maxwell, S., Chance, M.R., Koyutürk, M.: Efficiently enumerating all connected induced subgraphs of a large molecular network. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) AlCoB 2014. LNCS, vol. 8542, pp. 171–182. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07953-0_14

    Chapter  Google Scholar 

  10. Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math. 5(1), 54–66 (1992)

    Article  MathSciNet  Google Scholar 

  11. Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3), 237–252 (1975)

    Article  MathSciNet  Google Scholar 

  12. Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J. Comput. 26(3), 678–692 (1997)

    Article  MathSciNet  Google Scholar 

  13. Uno, T.: An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica 56(1), 3–16 (2010)

    Article  MathSciNet  Google Scholar 

  14. Uno, T.: Constant time enumeration by amortization. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 593–605. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21840-3_49

    Chapter  Google Scholar 

  15. Wasa, K., Kaneta, Y., Uno, T., Arimura, H.: Constant time enumeration of subtrees with exactly \(k\) nodes in a tree. IEICE Trans. Inf. Syst. 97–D(3), 421–430 (2014)

    Article  Google Scholar 

Download references

Acknowledgement

This work was supported by JSPS KAKENHI Grant Numbers JP16K00002, JP17K00003, and JP18H04091.

Author information

Authors and Affiliations

  1. Iwate University, Morioka, Japan

    Katsuhisa Yamanaka

  2. Tokai University, Hiratsuka, Japan

    Yasuko Matsui

  3. Gunma University, Kiryu, Japan

    Shin-ichi Nakano

Authors
  1. Katsuhisa Yamanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yasuko Matsui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shin-ichi Nakano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Katsuhisa Yamanaka .

Editor information

Editors and Affiliations

  1. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

  2. Shandong University, Jinan, China

    Daming Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yamanaka, K., Matsui, Y., Nakano, Si. (2018). More Routes for Evacuation. In: Wang, L., Zhu, D. (eds) Computing and Combinatorics. COCOON 2018. Lecture Notes in Computer Science(), vol 10976. Springer, Cham. https://doi.org/10.1007/978-3-319-94776-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94776-1_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94775-4

  • Online ISBN: 978-3-319-94776-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation