Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges.

Jacob Holm Valerie King Mikkel Thorup Or Zamir Uri Zwick

Published in: FOCS (2019)

Keyphrases

maximum matching
neural network
edge information
case study
np hard
directed graph
edge detector
uniformly distributed
image edges
decision trees
lower bound
weighted graph
edge enhancement