Burning number of graph products.

Dieter Mitsche Pawel Pralat Elham Roshanbin

Published in: Theor. Comput. Sci. (2018)

Keyphrases

small number
bayesian networks
database
computational complexity
structured data
undirected graph
fixed number
maximum number
polynomial time complexity