Locating the eigenvalues for graphs of small clique-width

DOI10.1007/978-3-319-77404-6_35MaRDI QIDQ2294708zbMATH OpenOpenAlexFDO

Authors Carlos Hoppen, Vilmar Trevisan, Martin Fürer, David P. Jacobs

Publication date 12 February 2020

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

zbMATH Keywords

clique-widthcongruent matricesefficient algorithmseigenvaluesparameterized algorithms

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Eigenvalue location in graphs of small clique-width
• Eigenvalue location in cographs
• Locating eigenvalues in graphs. Algorithms and applications
• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• Eigenvalue location in threshold graphs

Cited in

(3)

• Eigenvalue location in graphs of small clique-width
• Locating Eigenvalues of Symmetric Matrices - A Survey
• Efficient diagonalization of symmetric matrices associated with graphs of small treewidth

This page was built for publication: Locating the eigenvalues for graphs of small clique-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294708)