@inproceedings{b09df4cbed52452bb5418cfdb50de43a,

title = "Efficient diagonalization of symmetric matrices associated with graphs of small treewidth",

abstract = "Let M = (mij) be a symmetric matrix of order n and let G be the graph with vertex set {1, . . ., n} such that distinct vertices i and j are adjacent if and only if mij 6= 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 T of width k, then this can be done in time O(k|T | + k2n), where |T | denotes the number of nodes in T .",

author = "Martin F{\"u}rer and Carlos Hoppen and Vilmar Trevisan",

year = "2020",

month = jun,

day = "1",

doi = "10.4230/LIPIcs.ICALP.2020.52",

language = "English (US)",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Artur Czumaj and Anuj Dawar and Emanuela Merelli",

booktitle = "47th International Colloquium on Automata, Languages, and Programming, ICALP 2020",

note = "47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 ; Conference date: 08-07-2020 Through 11-07-2020",

}