Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Shaunak Kishore"'
Autor:
Hoda Bidkhori, Shaunak Kishore
Publikováno v:
Combinatorics, Probability and Computing. 20:11-25
The line graph G of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967, Knuth used the Matrix Tree Theorem to prove a formula for the number of spanning trees of G, and he asked for a bijective pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3599eb26252c927bbe264f5dd1a7a0df
https://doi.org/10.1017/s0963548310000192
https://doi.org/10.1017/s0963548310000192
Publikováno v:
CIKM
When users search online for a business, the search engine may present them with a list of related business recommendations. We address the problem of constructing a useful and diverse list of such recommendations that would include an optimal combin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cec033b1fd35c5c0b6d08227a1f03e2
https://doi.org/10.1145/2806416.2806495
https://doi.org/10.1145/2806416.2806495
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642222993
WADS
WADS
We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an O(δ) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ff40f600df9abbec6fc0c9b40c0dfeb
https://doi.org/10.1007/978-3-642-22300-6_21
https://doi.org/10.1007/978-3-642-22300-6_21
