2 papers
cs.DS2026
Fast and Practical Single-Exponential Algorithms for Branchwidth
Taiki Kaneda, Yasuaki Kobayashi, Hisao Tamaki
In this paper, we present exact exponential algorithms for computing branchwidth that are fast both in theory and in practice. The running times of these algorithms are single-expo…
cs.DS2025
A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki +1
We develop a new characterization of potential maximal cliques of a triconnected planar graph and, using this characterization, give a polynomial delay algorithm generating all pot…