Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative ...

To this end, we present, illustrate, and discuss three basic concepts of parameterized preprocessing in the context of polynomial-time solvable problems. Three directions of parameterized ...

D. CVETKOVIĆ, M. LEPOVIĆ, SEEKING COUNTEREXAMPLES TO THE RECONSTRUCTION CONJECTURE FOR THE CHARACTERISTIC POLYNOMIAL OF GRAPHS AND A POSITIVE RESULT, Bulletin (Académie serbe des sciences et des arts.

This paper introduces Polynomial Graphical Lasso (PGL), a new approach to learning graph structures from nodal signals. Our key contribution lies in modeling the signals as Gaussian and stationary on ...