scientific article; zbMATH DE number 3387374
From MaRDI portal
Publication:5656786
Cited in
(5)- scientific article; zbMATH DE number 3795354 (Why is no real title available?)
- The DT-polynomial approach to discrete time-varying network flow problems
- Tree decomposition algorithm for large networks
- A priority queue for the all pairs shortest path problem
- A very personal reminiscence on the problem of computational complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656786)