We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
Petros A. Petrosyan, Ani Shashikyan, Arman Yu. Tor...
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
Michele Conforti, Laurence A. Wolsey, Giacomo Zamb...
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
In this paper we present a new approach for automatic summarization of rushes video. Our approach is composed of three main steps. First, based on a temporal segmentation, we filte...
Liang Bai, Yan-Li Hu, Songyang Lao, Alan F. Smeato...