Enumerating maximal induced subgraphs
From MaRDI portal
Publication:6656975
DOI10.4230/lipics.esa.2023.31MaRDI QIDQ6656975
Publication date: 6 January 2025
Related Items (2)
An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints ⋮ Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
This page was built for publication: Enumerating maximal induced subgraphs
