scientific article
From MaRDI portal
Publication:3840350
zbMath0907.90271MaRDI QIDQ3840350
Peter Eades, Hiroshi Nagamochi
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (2)
Splitting off edges between two subsets preserving the edge-connectivity of the graph. ⋮ Graph connectivity and its augmentation: Applications of MA orderings
This page was built for publication: