• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

k-planar crossing number of random graphs and random regular graphs.

John AsplundThao DoArran HammLászló SzékelyLibby TaylorZhiyu Wang
Published in: Discret. Appl. Math. (2018)
Keyphrases
  • random graphs
  • graph theoretic
  • learning curves
  • phase transition
  • computational complexity
  • constraint satisfaction
  • directed graph
  • undirected graph
  • small world