This past October, as Jacob Holm and Eva Rotenberg were thumbing through a paper they’d posted a few months earlier, they realized they had been sitting on something big. For decades computer ...

Such studies furnish robust algorithms capable of handling a wide range of graph types, thereby opening new avenues for analysing the interplay between algebraic invariants and graph structure [3].

Using subgraph isomorphism algorithms from graph theory, the circuit is partitioned into several smaller sub-circuits, each containing no more qubits than the current quantum computer's capacity ...

Journal of Computational Mathematics, Vol. 33, No. 5 (September 2015), pp. 443-467 (25 pages) This paper presents a detailed review of both theory and algorithms for the Cheeger cut based on the graph ...

In July/August 2019, two things changed with Google's Knowledge Graph API that may be a turning point both for Google and for us as digital marketers.

Gleb Belov, Heide Rohling, LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility, Operations Research, Vol. 61, No. 2 (March-April 2013), pp. 483-497 ...