scientific article
From MaRDI portal
Publication:3936208
zbMath0478.68058MaRDI QIDQ3936208
Jurg Nievergelt, Edward M. Reingold, Narsingh Deo
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99) Discrete mathematics in relation to computer science (68Rxx)
Related Items (20)
Determining the Hamilton-connectedness of certain vertex-transitive graphs ⋮ Optimization of the movements of a component placement machine ⋮ Line broadcasting in cycles ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ A note on the m-center problem with rectilinear distances ⋮ Two-dimensional, viscous, incompressible flow in complex geometries on a massively parallel processor ⋮ Communication efficient multi-processor FFT ⋮ A simple systolic algorithm for generating combinations in lexicographic order ⋮ Parallel algorithms on circular-arc graphs ⋮ Finding bipartite subgraphs efficiently ⋮ Решение уравнений методом последовательного группирования и его оптимизация ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph ⋮ Fixed edge-length graph drawing is NP-hard ⋮ Solving elliptic partial differential equations on the hypercube multiprocessor ⋮ A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An analytical comparison of two string searching algorithms ⋮ Gray codes with restricted density ⋮ Asymptotic work estimates for AMLI methods
This page was built for publication:
