An algorithm for calculating the independence and vertex-cover polynomials of a graph
From MaRDI portal
Publication:2383889
DOI10.1016/j.amc.2007.02.028zbMath1122.68083OpenAlexW2067593774MaRDI QIDQ2383889
Publication date: 19 September 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.028
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work