Graph burning: Tight bounds on the burning numbers of path forests and spiders.
Ta Sheng TanWen Chean TehPublished in: Appl. Math. Comput. (2020)
Keyphrases
- tight bounds
- upper bound
- shortest path problem
- directed graph
- graph representation
- random walk
- bipartite graph
- graph structure
- graph theory
- random graphs
- path length
- graph model
- solution path
- structured data
- lower bound
- hamiltonian path
- temperature control
- strongly connected
- dependency graph
- graph mining
- graph search
- graph data
- neural network
- directed acyclic graph
- connected components
- similarity measure
- image segmentation