For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
This work exploits the idea that each individual brain region has a specific connection profile to create parcellations of the cortical surface using MR diffusion imaging. The par...
— This paper investigates in detail the blocking and nonblocking behavior of multirate Clos switching networks at the connection/virtual connection level. The results are applica...
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...