Enumeration Complexity: Incremental Time, Delay and Space
Y Strozecki - arXiv preprint arXiv:2309.17042, 2023 - arxiv.org
"Manuscript title" Page 1 UNIVERSITE DE VERSAILLES SAINT-QUENTIN-EN-YVELINES
Laboratoire Données et Algorithmes pour une Ville Intelligente et Durable David – UR 7431 …
Laboratoire Données et Algorithmes pour une Ville Intelligente et Durable David – UR 7431 …
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids
Finding a maximum cardinality common independent set in two matroids (also known as
Matroid Intersection) is a classical combinatorial optimization problem, which generalizes …
Matroid Intersection) is a classical combinatorial optimization problem, which generalizes …
Listing small minimal separators of a graph
T Korhonen - arXiv preprint arXiv:2012.09153, 2020 - arxiv.org
Let $ G $ be a graph and $ a, b $ vertices of $ G $. A minimal $ a, b $-separator of $ G $ is
an inclusion-wise minimal vertex set of $ G $ that separates $ a $ and $ b $. We consider the …
an inclusion-wise minimal vertex set of $ G $ that separates $ a $ and $ b $. We consider the …
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
In this paper, we consider the problems of enumerating minimal vertex covers and minimal
dominating sets with capacity and/or connectivity constraints. We develop polynomial-delay …
dominating sets with capacity and/or connectivity constraints. We develop polynomial-delay …
Polynomial-delay enumeration of large maximal matchings
Enumerating matchings is a classical problem in the field of enumeration algorithms. There
are polynomial-delay enumeration algorithms for several settings, such as enumerating …
are polynomial-delay enumeration algorithms for several settings, such as enumerating …
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints
K-best enumeration, which asks to output k-best solutions without duplication, is a helpful
tool in data analysis for many fields. In such fields, graphs typically represent data. Thus …
tool in data analysis for many fields. In such fields, graphs typically represent data. Thus …
省メモリなトップK 列挙アルゴリズムの設計技法
小林靖明， 栗田和宏 - 人工知能学会研究会資料人工知能基本問題研究 …, 2021 - jstage.jst.go.jp
抄録 One way to measure the efficiency of enumeration algorithms is to evaluate it with
respect to the input size and the number of solutions. Since the number of solutions can be …
respect to the input size and the number of solutions. Since the number of solutions can be …