4 citations · 4 across the 3 of their papers we have counts for
4 papers
Heuristic computation of exact treewidth
Hisao Tamaki
We are interested in computing the treewidth $\tw(G)$ of a given graph . Our approach is to design heuristic algorithms for computing a sequence of improving upper bounds and a…
A heuristic for listing almost-clique minimal separators of a graph
Hisao Tamaki
Bodlaender and Koster (Discrete Mathematics 2006) introduced the notion of almost-clique separators in the context of computing the treewidth $\tw(G)$ of a given graph . A separ…
A heuristic use of dynamic programming to upperbound treewidth
Hisao Tamaki
For a graph , let denote the set of all potential maximal cliques of . For each subset of , let $\tw(G, Π)$ denote the smallest such that there is a tree…
On the pathwidth of almost semicomplete digraphs
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
We call a digraph {\em -semicomplete} if each vertex of the digraph has at most non-neighbors, where a non-neighbor of a vertex is a vertex such that there is…