scientific article; zbMATH DE number 7088262
From MaRDI portal
Publication:5226843
zbMath1417.05010arXiv1712.03714MaRDI QIDQ5226843
Publication date: 1 August 2019
Full work available at URL: https://arxiv.org/abs/1712.03714
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
enumerationmaximal independent setspolynomial delayPost's latticeincremental polynomial timeset saturation
Exact enumeration problems, generating functions (05A15) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Generating clause sequences of a CNF formula ⋮ Enumerating models of DNF faster: breaking the dependency on the formula size ⋮ Maximal strongly connected cliques in directed graphs: algorithms and bounds ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ On the complexity of solution extension of optimization problems
This page was built for publication:
