@inproceedings{139d9cf47120436881b43cd7c2f72efe,

title = "Locating the eigenvalues for graphs of small clique-width",

abstract = "It is shown that if G has clique-width k, and a corresponding tree decomposition is known, then a diagonal matrix congruent to A- cI for constants c, where A is the adjacency matrix of the graph G of order n, can be computed in time O(k2n). This allows to quickly tell the number of eigenvalues in a given interval.",

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

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-77404-6_35",

language = "English (US)",

isbn = "9783319774039",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "475--489",

editor = "Mosteiro, {Miguel A.} and Bender, {Michael A.} and Martin Farach-Colton",

booktitle = "LATIN 2018",

address = "Germany",

note = "13th International Symposium on Latin American Theoretical Informatics, LATIN 2018 ; Conference date: 16-04-2018 Through 19-04-2018",

}