Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Ketan Dalal"'
Publikováno v:
Algorithms, Vol 16, Iss 11, p 500 (2023)
Linear probing continues to be one of the best practical hashing algorithms due to its good average performance, efficiency, and simplicity of implementation. However, the worst-case performance of linear probing seems to degrade with high load facto
Externí odkaz:
https://doaj.org/article/8970adcb6f0f4c0d950c6cc9afae9351
A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is $${\sum\nolimits_{e \mathrel\backepsilon v} {w{\left( e \right)}} }$$. We show that the edges of every graph that does not c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d8730e808d32324cea260fa9cc7e515
https://doi.org/10.1007/s00493-007-0041-6
https://doi.org/10.1007/s00493-007-0041-6
Publikováno v:
Journal of Combinatorial Theory, Series B. 94:237-244
A partition of the edges of a graph G into sets {S1,…,Sk} defines a multiset Xv for each vertex v where the multiplicity of i in Xv is the number of edges incident to v in Si. We show that the edges of every graph can be partitioned into 4 sets suc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab71afd15a3f11b905667ddaeae6ec4d
https://doi.org/10.1016/j.jctb.2005.01.001
https://doi.org/10.1016/j.jctb.2005.01.001
Autor:
Ketan Dalal
Publikováno v:
Random Structures and Algorithms. 24:155-165
Iteratively computing and discarding a set of convex hulls creates a structure known as an "onion." In this paper, we show that the expected number of layers of a convex hull onion for n uniformly and independently distributed points in a disk is Θ(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5e74d39088cf4d7967f7d49b7b1302a
https://doi.org/10.1002/rsa.10114
https://doi.org/10.1002/rsa.10114
Publikováno v:
NPAR
This paper presents improvements in mosaic packing by combining a new title evenness metric with an efficient, effective tile placement algorithm based on the Fast Fourier Transform. This new packing method applies to existing packing applications an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0d67c87da43ec2805a600fce1c1eaf2
https://doi.org/10.1145/1124728.1124741
https://doi.org/10.1145/1124728.1124741
Publikováno v:
Combinatorica; Feb2007, Vol. 27 Issue 1, p1-12, 12p
Publikováno v:
Discrete Applied Mathematics. (7):1168-1174
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16-edge-weighting version of a conjecture by Karoński, Łuczak and Thoma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abc95eb10b7f69164d4afdbfc24a7acc