677 search results - page 57 / 136 » Bipartite roots of graphs |
DM
2010
13 years 11 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
WWW
2001
ACM
14 years 11 months ago
2001
ACM
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be reg...
ORL
2008
13 years 11 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 10 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 4 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 ...