Locating the eigenvalues for graphs of small clique-width

DOI10.1007/978-3-319-77404-6_35zbMath1485.05100MaRDI QIDQ2294708

David P. Jacobs, Vilmar Trevisan, Carlos Hoppen, Martin Fuerer

Publication date: 12 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_35

zbMATH Keywords

eigenvalues; efficient algorithms; clique-width; parameterized algorithms; congruent matrices

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)