Lower bounds for the size in four families of minimum broadcast graphs.

Jean-François Saclé

Published in: Discret. Math. (1996)

Keyphrases

lower bound
constant factor
upper bound
branch and bound algorithm
graph matching
objective function
lower and upper bounds
maximal cliques
min sum
maximum clique
running times
random graphs
spanning tree
graph model
graph mining
memory requirements
directed graph
worst case
graph theory
regret bounds