Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

Minor-Free Graph: A graph that does not contain a specified smaller graph (minor) as a subgraph, which is critical for certifying graph classes and in achieving computational optimisations.

Graph processing at hyperscale has historically been a challenge because of the sheer complexity of algorithms and graph workflows. Alibaba has been tackling this issue via a project called GraphScope ...

The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. For decades, the graph isomorphism problem has held a special status within complexity theory. While ...

The graph below shows the total number of publications each year in Graph Theory and Computational Complexity. References [1] Vertex-substitution framework verifies the reconstruction conjecture ...