496 search results - page 41 / 100 » C4-saturated bipartite graphs |
ORL
2008
13 years 7 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
IACR
2011
12 years 7 months ago
2011
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...