Algorithms over dynamic graphs

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorGarcía-Gómez, Rafael A.-
Data de aceite: dc.date.accessioned2026-02-09T12:11:16Z-
Data de disponibilização: dc.date.available2026-02-09T12:11:16Z-
Data de envio: dc.date.issued2011-03-01-
Data de envio: dc.date.issued2017-08-01-
Data de envio: dc.date.issued2017-08-01-
Data de envio: dc.date.issued2017-08-01-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/15046-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1156191-
Descrição: dc.descriptionGraph theory provides mathematical models with computational realizations for a wide range of problems. The classic version provides static models and solutions for these problems. These solutions are often insufficient to versions of the problems in wich the information changes with respect to a continuous variable, eg. time. In the same way one can think on dynamic graphs as graphs in wich some components (arcs, edges, costs) change with respect to a continuous variable. This paper explores graphs with dynamic costs as a bundle, and includes the formulation and the solution for the shortest path problem and the maximum flow problem on these structures. This paper provides an unexplored connection between the dynamic graph theory and the topology, presents approaches to the solution of dynamic versions for the shortest path problem and the maximum flow problem, and proposes both a new source of applications of the metric bundles theory and the type two theory of effectivity.-
Formato: dc.formatapplication/pdf-
Formato: dc.formatapplication/pdf-
Publicador: dc.publisherUniversidade Federal de Lavras (UFLA)-
Relação: dc.relationhttp://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/322/478-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
???dc.source???: dc.sourceINFOCOMP; Vol 10 No 1 (2011): March, 2011; 1-7-
???dc.source???: dc.source1982-3363-
???dc.source???: dc.source1807-4545-
Palavras-chave: dc.subjectBundles of metric spaces-
Palavras-chave: dc.subjectGraphs with dynamic costs-
Palavras-chave: dc.subjectDynamic graphs-
Título: dc.titleAlgorithms over dynamic graphs-
Tipo de arquivo: dc.typeinfo:eu-repo/semantics/article-
Tipo de arquivo: dc.typeinfo:eu-repo/semantics/publishedVersion-
Aparece nas coleções:Repositório Institucional da Universidade Federal de Lavras (RIUFLA)

Não existem arquivos associados a este item.