The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...