Zobrazuji výsledky 11 - 18 z 18 pro vyhledávání '"Graph algorithms."', doba hledání: 0,01 s. Upřesnit hledání
  1. 11

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

    Vydáno v Journal of the ACM
    Článek

    Time-work tradeoffs for parallel algorithms.
  2. 12

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

    Článek

    The k-steiner ratio in graphs.
  3. 13

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

    Vydáno v MSDN magazine
    Článek

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

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

    Diplomová práce

    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. Autor Aranha, R.F.M

    Článek

    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. Autor Holm, Jacob

    Vydáno v Journal of the ACM
    Článek

    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. Autor Demetrescu, Camil

    Vydáno v Journal of the ACM
    Článek

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

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

    Vydáno v Journal of the ACM
    Článek

    Compact oracles for reachability and approximate distances in planar diagraphs.

Vyhledávací nástroje: