A Size Condition for Diameter Two Orientable Graphs.

Garner Cochran Éva Czabarka Peter Dankelmann László A. Székely

Published in: Graphs Comb. (2021)

Keyphrases

maximal cliques
uniform random
computational complexity
sufficient conditions
graph matching
real time
case study
memory requirements
bipartite graph
graph theory
database
pairwise
maximum clique