Login / Signup
An accessibility theorem for infinite graph minors.
Reinhard Diestel
Published in:
J. Graph Theory (2000)
Keyphrases
</>
graph structure
graph theory
structured data
graph representation
special case
random walk
graph theoretic
directed acyclic graph
spanning tree
weighted graph
dependency graph
graph search
graph partitioning
graph databases
graph mining
graph matching
directed graph
connected components
complex networks
np complete