Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...

In this special feature from The Exascale Report, industry thought leaders share their views on Graph computing. The Graph 500 is not new, but interest has recently been piqued as discussions are ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

Understanding the relationships in graph database theory allows us to work with the new 'shape' of data itself. Businesspeople like graphs. C-suite executives are fond of pie charts, Venn diagrams, ...

Are you sitting on a boatload of linked data, or have an innovative idea for a graph database? If so, then you might be interested in the $1 million in prize money that TigerGraph is putting up for ...

Polyglot persistence is becoming the norm in big data. Gone are the days when relational databases were the one store to rule them all; now the notion of using stores with data models that best align ...