directed acyclic graph
almost
faint
graphon
zero matrix
ultramodest
unitary
antiregular
arboricity
hull
quasipositive
Floyd-Warshall algorithm
microlattice
information
supergaussian
microengrave
semigraphitic
close
noncomprehensively
Johnson's algorithm
graphetically
sparsing
shoal
circumscribe
pointless topology
microcharacterization
compart
turning point
shallow
n-simplex
Eppstein's algorithm
trivial topology
Tutte matrix
cuboidal
supermodest
dice
minimum cut
nonconvex
square root decomposition
straight-sets
decrease
compatibility
compact space
subdrawing
jellyfish
at a minimum
nonsingular matrix