Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints

Documenti analoghi

• Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
  di: Kobayashi, Yasuaki, et al.
  Pubblicazione: (2020)
• On the complexity of finding a spanning even tree in a graph
  di: Hanaka, Tesshu, et al.
  Pubblicazione: (2024)
• Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
  di: Kobayashi, Yasuaki, et al.
  Pubblicazione: (2023)
• On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
  di: Kurita, Kazuhiro, et al.
  Pubblicazione: (2025)
• The Complexity of Maximal Common Subsequence Enumeration
  di: Buzzega, Giovanni, et al.
  Pubblicazione: (2025)