On Finding Optimal (Dynamic) Arborescences

Let G=(V,E) be a directed and weighted graph with a vertex set V of size n and an edge set E of size m such that each edge (u,v)∈E has a real-valued weight w(u,c). An arborescence in G is a subgraph T=(V,E′) such that, for a vertex u∈V, which is the root, there is a unique path in T from u to any ot...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithms Vol. 16; no. 12; p. 559
Main Authors:	Espada, Joaquim, Francisco, Alexandre P., Rocher, Tatiana, Russo, Luís M. S., Vaz, Cátia
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.12.2023
Subjects:	algorithm engineering Algorithms Design optimization dynamic algorithm Edmonds’ algorithm Graph theory Graphs Inference Minimum weight Network design optimal arborescences Phylogenetics Phylogeny Traveling salesman problem Vertex sets Portugal
ISSN:	1999-4893, 1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!