2 papers
math.CO2022
A Linear Algorithm for Computing Independence Polynomials of Trees
Ohr Kadrawi, Vadim E. Levit, Ron Yosef +1
An independent set in a graph is a set of pairwise non-adjacent vertices. Let denote the cardinality of a maximum independent set in the graph . Gutman and Harar…
cs.LG2021
On Bi-gram Graph Attributes
Thomas Konstantinovsky, Matan Mizrachi
We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attrib…