Burning Graphs Through Farthest-First Traversal
Graph burning is a process to determine the spreading of information in a graph. If a sequence of vertices burns all the vertices of a graph by following the graph burning process, then such a sequence is known as a burning sequence. The graph burning problem consists in finding a minimum length bur...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
IEEE
2022-01-01
|
| Edice: | IEEE Access |
| Témata: | |
| On-line přístup: | https://ieeexplore.ieee.org/document/9734068/ |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|