research
∙
11/04/2021
Finding All Leftmost Separators of Size ≤ k
We define a notion called leftmost separator of size at most k. A leftmo...
share
research
∙
09/06/2021
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
Let M=(m_ij) be a symmetric matrix of order n whose elements lie in an a...
research
∙
10/07/2020
An Improvement of Reed's Treewidth Approximation
We present a new approximation algorithm for the treewidth problem which...
research
∙
01/21/2019
A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation
An NP-hard graph problem may be intractable for general graphs but it co...
research
∙
11/28/2017