A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
A commonly encountered problem when creating 3D models of large real scenes is unnatural color texture fusion. Due to variations in lighting and camera settings (both manual and a...
Nobuyuki Bannai, Robert B. Fisher, Alexander Agath...