Search
Selected: All

Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Space Data Structures for Range Mode Query in Arrays

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Space Substring Range Counting over Polylogarithmic Alphabets

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Lipschitz Unimodal and Isotonic Regression on Paths and Trees

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

List decoding of noisy Reed-Muller-like codes

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

List Factoring and Relative Worst Order Analysis

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Listing All Maximal Cliques in Large Sparse Real-World Graphs

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Local Approximation Schemes for Topology Control

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Local Search Heuristics For The Multidimensional Assignment Problem

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.