Sciweavers

44 search results - page 1 / 9
» Probe Ptolemaic Graphs
Sort
View
COCOON
2008
Springer
13 years 5 months ago
Probe Ptolemaic Graphs
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van...
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 3 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 7 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
13 years 8 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
13 years 3 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...