Extended network and algorithm finding maximal flows

Publication:

Extended network and algorithm finding maximal flows

dc.contributor.author	Trần Ngọc Việt
dc.date.accessioned	2023-05-12T01:40:22Z
dc.date.available	2023-05-12T01:40:22Z
dc.date.issued	2020
dc.description.abstract	Graph is a powerful mathematical tool applied in many fields as transportation, communication,informatics, economy, in ordinary graph the weights of edges and vertexes are considered independentlywhere the length of a path is the sum of weights of the edges and the vertexes on this path. However, inmany practical problems, weights at a vertex are not the same for all paths passing this vertex, but dependon coming and leaving edges. The paper develops a model of extended network that can be applied tomodelling many practical problems more exactly and effectively. The main contribution of this paper isalgorithm finding maximal flows on extended networks
dc.identifier.uri	http://repository.vlu.edu.vn:443/handle/123456789/4660
dc.language.iso	en_US
dc.relation.ispartof	International Journal of Electrical and Computer Engineering
dc.relation.issn	2088-8707
dc.subject	Extended network
dc.subject	Graph
dc.title	Extended network and algorithm finding maximal flows
dc.type	Resource Types::text::journal
dspace.entity.type	Publication
oaire.citation.issue	2
oaire.citation.volume	10
oairecerif.author.affiliation	#PLACEHOLDER_PARENT_METADATA_VALUE#

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1