Complexity of Combinatorial Algorithms

DOI10.1137/1020067MaRDI QIDQ4164820zbMATH OpenOpenAlexFDO

Authors Robert E. Tarjan

Publication date 1978

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1020067

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(5)

• Degree switching operations in networks and large scale systems assignment problems
• A note on Euclidean near neighbor searching in the plane
• Full transversal matroids, strict gammoids, and the matroid components problem
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines

This page was built for publication: Complexity of Combinatorial Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4164820)