Login / Signup
Almost spanning subgraphs of random graphs after adversarial edge removal.
Julia Böttcher
Yoshiharu Kohayakawa
Anusch Taraz
Published in:
Electron. Notes Discret. Math. (2009)
Keyphrases
</>
random graphs
undirected graph
graph theoretic
learning curves
phase transition
edge detection
data structure
complex networks
special case
directed graph
approximation algorithms
graph structure
attributed graphs
small world
spanning tree
weighted graph
graph databases
graph matching