The Maximum Flows in Planar Dynamic Networks | Zendy

Camelia Șchiopu | Zendy; Eleonor Ciurea | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Maximum Flows in Planar Dynamic Networks

Author(s) -

Camelia Șchiopu,

Eleonor Ciurea

Publication year - 2016

Publication title -

international journal of computers communications and control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.422

H-Index - 33

eISSN - 1841-9844

pISSN - 1841-9836

DOI - 10.15837/ijccc.2016.2.2444

Subject(s) - traverse , maximum flow problem , planar , arc (geometry) , computer science , flow (mathematics) , flow network , planar graph , dynamic network analysis , tree traversal , constant (computer programming) , graph , topology (electrical circuits) , algorithm , mathematics , mathematical optimization , combinatorics , theoretical computer science , geometry , computer network , computer graphics (images) , geodesy , programming language , geography

An nontrivial extension of the maximal static flow problem is the maximal dynamic flow model, where the transit time to traverse an arc is taken into consideration. If the network parameters as capacities, arc traversal times, and so on, are constant over time, then a dynamic flow problem is said to be stationary. Research on flow in planar static network is motivated by the fact that more efficient algorithms can be developed by exploiting the planar structure of the graph. This article states and solves the maximum flow in directed (1, n) planar dynamic networks in the stationary case.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research