Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs

Solving problems on graphs dynamically calls for algorithms to function under repeated modifications to the graph and to be more efficient than solving the problem for the whole graph from scratch after each modification. Dynamic algorithms have been considered for several graph properties, for exam...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 85; číslo 8; s. 2454 - 2481
Hlavní autoři:	Beisegel, Jesse, Köhler, Ekkehard, Scheffler, Robert, Strehler, Martin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2023 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Mathematics of Computing Problem solving Recognition Shortest-path problems Theory of Computation 05C45 Hamiltonian cycles 05C85 Chain graphs Difference graphs Hamiltonian paths Fully dynamic algorithms Threshold graphs 68R10
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!