Download PDF Join the Discussion View in the ACM Digital Library EXAMPLE 2. A standard way of representing graphs is by their adjacency matrices; once we have an adjacency matrix we can obtain a {0, 1 ...

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 ...

Abstract: Although graph structures have proved useful in high level vision for object recognition and matching, they can prove computationally cumbersome because of the need to establish reliable ...

This project is a Python application that uses a Polynomial Network to analyze and fit a polynomial to a set of data points. The application provides a GUI for users to interact with the data and the ...

Abstract: We investigate graph convolution networks with efficient learning from higher-order graph convolutions and direct learning from adjacency matrices for node classification. We revisit the ...

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...

The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton ...