External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model

Matthias Bentert, Jannik Schestag, Frank Sommer. On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. In Neeldhara Misra, Magnus Wahlström, editors, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands. Volume 285 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Matthias Bentert

This author has not been identified. Look up 'Matthias Bentert' in Google

Jannik Schestag

This author has not been identified. Look up 'Jannik Schestag' in Google

Frank Sommer

This author has not been identified. Look up 'Frank Sommer' in Google
runs on