Showing 11 - 18 results of 18 for search '"Graph algorithms."', Forespørselstid: 0.02s Refine Results
  1. 11

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

    Udgivet i Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  2. 12

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

    Article

    The k-steiner ratio in graphs.
  3. 13

    Tabu algorithms and maximum clique. IN Test run. af McCaffrey, James

    Udgivet i MSDN magazine
    Article

    Tabu algorithms and maximum clique. IN Test run.
  4. 14

    An algorithm for generating random graphs with prescribed degree sequence af Austria, Darrwin Dearest C.

    Thesis

    An algorithm for generating random graphs with prescribed degree sequence
  5. 15

    An efficient distributed algorithm for centering a spanning tree of a biconnected graph. af Aranha, R.F.M

    Article

    An efficient distributed algorithm for centering a spanning tree of a biconnected graph.
  6. 16

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. af Holm, Jacob

    Udgivet i Journal of the ACM
    Article

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
  7. 17

    A new approach to dynamic all pairs shortest paths. af Demetrescu, Camil

    Udgivet i Journal of the ACM
    Article

    A new approach to dynamic all pairs shortest paths.
  8. 18

    Compact oracles for reachability and approximate distances in planar diagraphs. af Thorup, M.

    Udgivet i Journal of the ACM
    Article

    Compact oracles for reachability and approximate distances in planar diagraphs.

Søgeredskaber: