Login / Signup

On Characterizing the Local Pooling Factor of Greedy Maximal Scheduling in Random Graphs.

Jeffrey WildmanSteven Weber
Published in: IEEE/ACM Trans. Netw. (2016)
Keyphrases
  • random graphs
  • graph theoretic
  • learning curves
  • scheduling problem
  • phase transition
  • scheduling algorithm
  • greedy algorithm
  • search algorithm
  • undirected graph
  • search space
  • attributed graphs
  • small world
  • special case