Algorithms and Computation
From MaRDI portal
Publication:5897926
DOI10.1007/11602613zbMath1175.68544OpenAlexW2304246803MaRDI QIDQ5897926
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Related Items
The density maximization problem in graphs ⋮ Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes ⋮ Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths ⋮ Invulnerability of planar two-tree networks ⋮ An improved algorithm for finding a length-constrained maximum-density subtree in a tree
This page was built for publication: Algorithms and Computation