Showing 231 - 240 results of 275 for search '"graph theory."', query time: 0.02s Refine Results
  1. 231

    Conflict-free channel assignment for an optical cluster-based shuffle network configuration. by Aly, Khaled A.

    Article

    Conflict-free channel assignment for an optical cluster-based shuffle network configuration.
  2. 232

    Routing reserved bandwith multi-point connections. by Verma, Dinesh C.

    Article

    Routing reserved bandwith multi-point connections.
  3. 233

    Structural complexity and execution efficiency of distributed application protocols. by Ravindran, K.

    Article

    Structural complexity and execution efficiency of distributed application protocols.
  4. 234

    Edge-disjoint routing in plane switch graphs in linear time. by Hochstein, J.M

    Published in Journal of the ACM
    Article

    Edge-disjoint routing in plane switch graphs in linear time.
  5. 235

    Sparsification-a technique for speeding up dynamic graph algorithms. by Eppstein, David

    Published in Journal of the ACM
    Article

    Sparsification-a technique for speeding up dynamic graph algorithms.
  6. 236

    Time-work tradeoffs for parallel algorithms. by Spencer, Thomas H.

    Published in Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  7. 237

    Polynomial-time data reduction for dominating set. by Alber, Jochen

    Published in Journal of the ACM
    Article

    Polynomial-time data reduction for dominating set.
  8. 238

    Weighted coloring based channel assignment for WLANs. by Mishra, Arunesh

    Article

    Weighted coloring based channel assignment for WLANs.
  9. 239

    The k-steiner ratio in graphs. by Borchers, Al

    Article

    The k-steiner ratio in graphs.
  10. 240

    On chromatic polynomials and colorability by Sakchai Watchara-Amphaiwan 1950-

    Book

    On chromatic polynomials and colorability

Search Tools: