2 papers
cs.DS2024
Computing diverse pair of solutions for tractable SAT
Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi +3
In many decision-making processes, one may prefer multiple solutions to a single solution, which allows us to choose an appropriate solution from the set of promising solutions tha…
math.CO2024
Basis sequence reconfiguration in the union of matroids
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi +2
Given a graph and two spanning trees and in , Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from to such that all inter…