On the size of planarly connected crossing graphs.

Eyal Ackerman Balázs Keszegh Máté Vizer

Published in: J. Graph Algorithms Appl. (2018)

Keyphrases

graph theoretic
databases
computational complexity
graph theory
graph structure
neural network
random walk
connected components
directed graph
standard deviation
graph mining
graph databases
maximum number
graph representation