Login / Signup
The minimum number of triangles covering the edges of a graph.
Jenö Lehel
Published in:
J. Graph Theory (1989)
Keyphrases
</>
undirected graph
small number
directed acyclic graph
directed graph
weighted graph
spanning tree
memory requirements
bipartite graph
image segmentation
computational complexity
structured data
connected components
random graphs
massive graphs
connected graphs
nodes of a graph