Complexity of Combinatorial Algorithms
From MaRDI portal
Publication:4164820
DOI10.1137/1020067zbMath0384.68045OpenAlexW2064047404MaRDI QIDQ4164820
Publication date: 1978
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1020067
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Full transversal matroids, strict gammoids, and the matroid components problem ⋮ Degree switching operations in networks and large scale systems assignment problems ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ A note on Euclidean near neighbor searching in the plane ⋮ Algorithmic complexity: threeNP- hard problems in computational statistics
This page was built for publication: Complexity of Combinatorial Algorithms
