Journal•ISSN: 0196-6774
Journal of Algorithms
Academic Press
About: Journal of Algorithms is an academic journal. The journal publishes majorly in the area(s): Time complexity & Approximation algorithm. It has an ISSN identifier of 0196-6774. Over the lifetime, 1166 publications have been published receiving 66637 citations.
Topics: Time complexity, Approximation algorithm, Chordal graph, Upper and lower bounds, Parallel algorithm
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, the authors introduce a sublinear space data structure called the countmin sketch for summarizing data streams, which allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition it can be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc.
1,939 citations
••
TL;DR: An invariant of graphs called the tree-width is introduced, and used to obtain a polynomially bounded algorithm to test if a graph has a subgraph contractible to H, where H is any fixed planar graph.
1,726 citations
••
TL;DR: Using a variation of the interpretability concept, it is shown that all graph properties definable in monadic second-order logic with quantification over vertex and edge sets can be decided in linear time for classes of graphs of fixed bounded treewidth given a tree-decomposition.
940 citations
••
TL;DR: A technique due to A. Joffe (1974) is applied and deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments is obtained.
917 citations
••
TL;DR: This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson.
857 citations