Weighted total acquisition

In the Weighted Total Acquisition problem (WTA) on a weighted graph G (only positive non-zero weights), a vertex v can acquire the total weight of a neighbour u if and only if the current weight of v is at least that of u. The new weight of u is then zero, and the new weight of v is then the sum of...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 304; s. 260 - 282
Hlavní autori:	Bagan, Guillaume, Gledel, Valentin, Heinrich, Marc, Mc Inerney, Fionn
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 15.12.2021 Elsevier BV Elsevier
Predmet:	Algorithms Apexes Complexity Computer Science Discrete Mathematics Dynamic programming Graphs Parameterization Polynomials Sequences Total acquisition Trees (mathematics) Treewidth Weighting functions Total acquisition Dynamic programming Complexity Treewidth
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!