On the non-submodularity of the problem of adding links to minimize the effective graph resistance

Documenti analoghi

• On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
  di: Bengali, Vedangi, et al.
  Pubblicazione: (2024)
• Enumerating minimal solution sets for metric graph problems
  di: Bergougnoux, Benjamin, et al.
  Pubblicazione: (2023)
• Continuous optimization methods for the graph isomorphism problem
  di: Klus, Stefan, et al.
  Pubblicazione: (2023)
• Enumerating minimal dominating sets and variants in chordal bipartite graphs
  di: Castelo, Emanuel, et al.
  Pubblicazione: (2025)
• Generating minimal redundant and maximal irredundant sets in incidence graphs
  di: Castelo, Emanuel, et al.
  Pubblicazione: (2026)