The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph ...

For simplicity of exposition, we assume that f is a well-behaved (differentiable) function. Consider the graph of f, i.e., the points (x,f(x)) in an n+1 dimensional space. The fact that the function f ...

Matrix inequalities and convex functions constitute a central theme in modern mathematical analysis, with far‐reaching implications across numerical analysis, optimisation, quantum information ...

Convex optimization-based graph algorithms nonetheless achieve impressive theoretical performance, and often provide a beautiful geometric interpretation. This package implements some of these ...

A multi-threaded library for the manipulation of directed-graphs. It allows to perform queries and modifications such as reachability, partitioning, convex partitioning and coarsening via multiple ...