„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
  Balas, E. ; Xue, Jue
• On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
  Mehlhorn, K. ; Mutzel, P.
• Efficiently extendible mappings for balanced data distribution
  Choy, D. M. ; Fagin, R. ; Stockmeyer, L.
• A New combinatorial approach to optimal embeddings of rectangles
  Huang, Shou-Hsuan S. ; Liu, Hongfei ; Verma, Rakesh M.
• Fast stable in-place sorting withO(n) data moves
  Munro, J. I. ; Raman, V.
• Competitive distributed decision-making
  Deng, Xiaotie ; Papadimitriou, C. H.
• Scheduling tree dags on parallel architectures
  Kalpakis, K. ; Yesha, Y.
• A paradigm for listing (s, t)-cuts in graphs
  Provan, J. S. ; Shier, D. R.
• The implementation of linear programming algorithms based on homotopies
  Nazareth, J. L.
• Fast deterministic selection on mesh-connected processor arrays
  Krizanc, D. ; Narayanan, L. ; Raman, R.
• On-line maintenance of triconnected components with SPQR-trees
  Battista, G. Di ; Tamassia, R.
• Designing checkers for programs that run in parallel
  Rubinfeld, R.
• Data structures to vectorize CG algorithms for general sparsity patterns
  Paolini, Gaia Valeria ; Brozolo, Giuseppe Radicati Di
• Bidirectional edges problem: Part I—A simple algorithm
  Mishra, B.
• Optimal parallel algorithm for findingst-ambitus of a planar biconnected graph
  Easwarakumar, K. S. ; Krishnan, S. V. ; Rangan, C. Pandu ; Seshadri, S.
• Incremental topological flipping works for regular triangulations
  Edelsbrunner, H. ; Shah, N. R.
• A constrained edit distance between unordered labeled trees
  Zhang, Kaizhong
• Shellsort with a constant number of increments
  Weiss, M. A.
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
  Johnson, D. B. ; Metaxas, P.
• Generating rooted triangulations without repetitions
  Avis, D.