AAAAAA

   
Results: 1-13 |
Results: 13
THE E-MAIL GOSSIP NUMBER AND THE CONNECTED DOMINATION NUMBER
Authors: HARARY F RAGHAVACHARI B
Citation: F. Harary et B. Raghavachari, THE E-MAIL GOSSIP NUMBER AND THE CONNECTED DOMINATION NUMBER, Applied mathematics letters, 10(4), 1997, pp. 15-17
A NETWORK-FLOW TECHNIQUE FOR FINDING LOW-WEIGHT BOUNDED-DEGREE SPANNING-TREES
Authors: FEKETE SP KHULLER S KLEMMSTEIN M RAGHAVACHARI B YOUNG N
Citation: Sp. Fekete et al., A NETWORK-FLOW TECHNIQUE FOR FINDING LOW-WEIGHT BOUNDED-DEGREE SPANNING-TREES, Journal of algorithms, 24(2), 1997, pp. 310-324
LANDMARKS IN GRAPHS
Authors: KHULLER S RAGHAVACHARI B ROSENFELD A
Citation: S. Khuller et al., LANDMARKS IN GRAPHS, Discrete applied mathematics, 70(3), 1996, pp. 217-229
ON STRONGLY CONNECTED DIGRAPHS WITH BOUNDED CYCLE LENGTH
Authors: KHULLER S RAGHAVACHARI B YOUNG N
Citation: S. Khuller et al., ON STRONGLY CONNECTED DIGRAPHS WITH BOUNDED CYCLE LENGTH, Discrete applied mathematics, 69(3), 1996, pp. 281-289
IMPROVED APPROXIMATION ALGORITHMS FOR UNIFORM CONNECTIVITY PROBLEMS
Authors: KHULLER S RAGHAVACHARI B
Citation: S. Khuller et B. Raghavachari, IMPROVED APPROXIMATION ALGORITHMS FOR UNIFORM CONNECTIVITY PROBLEMS, Journal of algorithms, 21(2), 1996, pp. 434-450
LOW-DEGREE SPANNING-TREES OF SMALL WEIGHT
Authors: KHULLER S RAGHAVACHARI B YOUNG N
Citation: S. Khuller et al., LOW-DEGREE SPANNING-TREES OF SMALL WEIGHT, SIAM journal on computing, 25(2), 1996, pp. 355-368
AN EFFICIENT PARALLEL ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN DENSE DIRECTED-GRAPHS
Authors: FURER M RAGHAVACHARI B
Citation: M. Furer et B. Raghavachari, AN EFFICIENT PARALLEL ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN DENSE DIRECTED-GRAPHS, Journal of algorithms, 18(2), 1995, pp. 203-220
BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
Authors: KHULLER S RAGHAVACHARI B YOUNG N
Citation: S. Khuller et al., BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES, Algorithmica, 14(4), 1995, pp. 305-321
APPROXIMATING THE MINIMUM EQUIVALENT DIGRAPH
Authors: KHULLER S RAGHAVACHARI B YOUNG N
Citation: S. Khuller et al., APPROXIMATING THE MINIMUM EQUIVALENT DIGRAPH, SIAM journal on computing, 24(4), 1995, pp. 859-872
OPTIMAL PARALLEL ALGORITHMS FOR STRAIGHT-LINE GRID EMBEDDINGS OF PLANAR GRAPHS
Authors: KAO MY FURER M HE X RAGHAVACHARI B
Citation: My. Kao et al., OPTIMAL PARALLEL ALGORITHMS FOR STRAIGHT-LINE GRID EMBEDDINGS OF PLANAR GRAPHS, SIAM journal on discrete mathematics, 7(4), 1994, pp. 632-646
OPTIMAL PARALLEL ALGORITHMS FOR STRAIGHT-LINE GRID EMBEDDINGS OF PLANAR GRAPHS
Authors: KAO MY FURER M HE X RAGHAVACHARI B
Citation: My. Kao et al., OPTIMAL PARALLEL ALGORITHMS FOR STRAIGHT-LINE GRID EMBEDDINGS OF PLANAR GRAPHS, SIAM journal on discrete mathematics, 7(4), 1994, pp. 632-646
APPROXIMATING THE MINIMUM-DEGREE STEINER TREE TO WITHIN ONE OF OPTIMAL
Authors: FURER M RAGHAVACHARI B
Citation: M. Furer et B. Raghavachari, APPROXIMATING THE MINIMUM-DEGREE STEINER TREE TO WITHIN ONE OF OPTIMAL, Journal of algorithms, 17(3), 1994, pp. 409-423
DESIGNING MULTICOMMODITY FLOW TREES
Authors: KHULLER S RAGHAVACHARI B YOUNG N
Citation: S. Khuller et al., DESIGNING MULTICOMMODITY FLOW TREES, Information processing letters, 50(1), 1994, pp. 49-55
Risultati: 1-13 |