Efficient diagonalization of symmetric matrices associated with graphs of small treewidth

09/06/2021
βˆ™
by   Martin FΓΌrer, et al.
βˆ™
0
βˆ™

Let M=(m_ij) be a symmetric matrix of order n whose elements lie in an arbitrary field 𝔽, and let G be the graph with vertex set {1,…,n} such that distinct vertices i and j are adjacent if and only if m_ijβ‰  0. We introduce a dynamic programming algorithm that finds a diagonal matrix that is congruent to M. If G is given with a tree decomposition 𝒯 of width k, then this can be done in time O(k|𝒯| + k^2 n), where |𝒯| denotes the number of nodes in 𝒯. Among other things, this allows one to compute the determinant, the rank and the inertia of a symmetric matrix in time O(k|𝒯| + k^2 n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 09/17/2019

A heuristic use of dynamic programming to upperbound treewidth

For a graph G, let Ξ©(G) denote the set of all potential maximal cliques ...
research
βˆ™ 04/01/2020

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph

It is well known that the treewidth of a graph G corresponds to the node...
research
βˆ™ 06/10/2022

Some Extremal Symmetric Inequalities

Let β„‹_n,d^s := ℝ[x_1,…, x_n]_d^𝔖_n be the set of symmetric polynomials o...
research
βˆ™ 11/05/2021

Fast FPT-Approximation of Branchwidth

Branchwidth determines how graphs, and more generally, arbitrary connect...
research
βˆ™ 09/14/2023

Dynamic programming on bipartite tree decompositions

We revisit a graph width parameter that we dub bipartite treewidth, alon...
research
βˆ™ 08/25/2017

Spectral and Combinatorial Properties of Some Algebraically Defined Graphs

Let k> 3 be an integer, q be a prime power, and F_q denote the field of ...
research
βˆ™ 06/02/2018

On Minrank and Forbidden Subgraphs

The minrank over a field F of a graph G on the vertex set {1,2,...,n} is...

Please sign up or login with your details

Forgot password? Click here to reset