138 search results - page 15 / 28 » Bisimplicial Edges in Bipartite Graphs |
DM
2007
13 years 7 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
DM
2000
13 years 7 months ago
2000
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
AAAI
2008
13 years 9 months ago
2008
Query recommendation is considered an effective assistant in enhancing keyword based queries in search engines and Web search software. Conventional approach to query recommendati...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...