AAAAAA

   
Results: 1-6 |
Results: 6

Authors: PROVAN JS CHARI MK
Citation: Js. Provan et Mk. Chari, COUNTING PROBLEMS ASSOCIATED WITH STEINER TREES IN GRAPHS, SIAM journal on discrete mathematics, 10(3), 1997, pp. 436-446

Authors: CHARI MK
Citation: Mk. Chari, 2 DECOMPOSITIONS IN TOPOLOGICAL COMBINATORICS WITH APPLICATIONS TO MATROID COMPLEXES, Transactions of the American Mathematical Society, 349(10), 1997, pp. 3925-3943

Authors: CHARI MK PROVAN JS
Citation: Mk. Chari et Js. Provan, CALCULATING K-CONNECTEDNESS RELIABILITY USING STEINER BOUNDS, Mathematics of operations research, 21(4), 1996, pp. 905-921

Authors: CHARI MK FEO TA PROVAN JS
Citation: Mk. Chari et al., THE DELTA-WYE APPROXIMATION PROCEDURE FOR 2-TERMINAL RELIABILITY, Operations research, 44(5), 1996, pp. 745-757

Authors: CHARI MK
Citation: Mk. Chari, ON REVERSIBLE SEMI-MARKOV PROCESSES, Operations research letters, 15(3), 1994, pp. 157-161

Authors: CHARI MK
Citation: Mk. Chari, STEINER COMPLEXES, MATROID PORTS, AND SHELLABILITY, J COMB TH B, 59(1), 1993, pp. 41-68
Risultati: 1-6 |