We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
A novel method for projecting points onto a point cloud, possibly with noise, is presented based on the point directed projection (DP) algorithm proposed by Azariadis P., Sapidis ...
Background: Gene-set analysis evaluates the expression of biological pathways, or a priori defined gene sets, rather than that of individual genes, in association with a binary ph...
Irina Dinu, John D. Potter, Thomas Mueller, Qi Liu...
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...