Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

DOI10.1007/978-3-642-04128-0_2zbMath1256.05232OpenAlexW1826937585MaRDI QIDQ3639231

Martin Fuerer

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_2

zbMATH Keywords

characteristic polynomialefficient algorithmsbounded tree-widthcounting independent setscounting matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Locating the eigenvalues of trees

This page was built for publication: Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks