Your browser does not fully support modern features. Please upgrade for a smoother experience.
Graph Burning
- Subjects: Computer Science, Theory & Methods
- |
- Contributor:
- Jesús García Díaz
- graph burning
- social contagion
Video Introduction
The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify how vulnerable is a graph to contagion.
Full Transcript
${ textCharacter }/${ maxCharacter }
Submit
Cancel
Back
Comments
${ item }
|
${ item.createdUser.fullName }
${ item.createdAt }
${ item.vote }
${ item.reply }
Delete
${ reply.createdUser.fullName }
${ reply.createdAt }
${ reply.vote }
Delete
There is no reply to this comment~
${ item.replyTextCharacter }/${ item.replyMaxCharacter }
Submit
Cancel
More
No more~
There is no comment~
${ textCharacter }/${ maxCharacter }
Submit
Cancel
${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
Submit
Cancel
Confirm
Are you sure to Delete?
Yes
No
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
García Díaz, J. Graph Burning. Encyclopedia. Available online: https://encyclopedia.pub/video/video_detail/934 (accessed on 11 January 2026).
García Díaz J. Graph Burning. Encyclopedia. Available at: https://encyclopedia.pub/video/video_detail/934. Accessed January 11, 2026.
García Díaz, Jesús. "Graph Burning" Encyclopedia, https://encyclopedia.pub/video/video_detail/934 (accessed January 11, 2026).
García Díaz, J. (2023, October 09). Graph Burning. In Encyclopedia. https://encyclopedia.pub/video/video_detail/934
García Díaz, Jesús. "Graph Burning." Encyclopedia. Web. 09 October, 2023.
Copy Citation