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.

John wonders if I’m just discovering all the complexity stuff he and George were writing about back in the 1990s. ... That Old Time Complexity. By Carl Zimmer. November 20, 2007 ...

Same with The Graph: you're outsourcing that to The Graph network, so you don't have to think about it and you can just build really amazing applications. Almost all of DeFi uses The Graph.

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