The DT-polynomial approach to discrete time-varying network flow problems
type: Item
instance of: scholarly article
title: The DT-polynomial approach to discrete time-varying network flow problems
zbMATH Open document ID: 0373.90024
DOI: 10.1016/0016-0032(78)90107-2
author: K. Appert
published in: Journal of the Franklin Institute
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3581881
MaRDI profile type: Publication
full work available at URL: 0016-0032(78)90107-2
OpenAlex ID: W1965353069
cites work: Q5514188
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Minimum cost routing for dynamic network models
cites work: On building minimum cost communication networks over time
cites work: Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
cites work: Maximal, Lexicographic, and Dynamic Network Flows
cites work: Dynamic network flows with arc changes
cites work: On Multi-Commodity Maximal Dynamic Flows
cites work: Shortest path with time constraints on movement and parking
cites work: Topological sorting of large networks
cites work: Depth-First Search and Linear Graph Algorithms
cites work: On the computational power of pushdown automata
cites work: Q5656786
description: scientific article; zbMATH DE number 3581881