Experimental and Efficient Algorithms
From MaRDI portal
Publication:5710048
DOI10.1007/b136461zbMath1121.05315MaRDI QIDQ5710048
Angelika Steger, Andreas Weißl, Justus Schwartz
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
68W40: Analysis of algorithms
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Dynamic discrete tomography, A least-squares minimum-cost network flow algorithm, Parameterized Complexity of k-Anonymity: Hardness and Tractability