What people are saying - Write a review
We haven't found any reviews in the usual places.
Beyond the Flow Decomposition Barrier
Undirected Single Source Shortest Path in Linear Time
A Faster Deterministic Algorithm for Minimum Spanning Trees
34 other sections not shown
access graph adversary algorithm alternating strip apply approximation approximation algorithm assignment assume bits block Boolean cell cellular automaton chordal graphs circuit competitive ratio complexity Computer Science conﬁguration consider constant construction corresponding cryptography deﬁned deﬁnition denote deterministic distribution edge encryption exists ﬁeld ﬁll ﬁnd ﬁnding ﬁnite ﬁrst ﬁxed ﬂow formula function given graph G grid graphs IEEE inﬁnite input integer interval graph lattice least Lemma length linear load lower bound matching maximum minimal minimum node Note NP-hard obtain online algorithm optimal output packet pair parenthesis partition phase planar graphs polynomial polynomial-time prob probabilistic probability problem Proc processor protocol prove quantiﬁer queue random result rithm satisﬁes scheme sequence simulation solution speciﬁc step strategy string subgraph subset Symposium Theory of Computing tion tree undirected graphs unsplittable upper bound variables vector veriﬁer vertex vertices zero-knowledge zero-knowledge proof