Jane N. Hagstrom

发表

Computational complexity of PERT problems

Jane N. Hagstrom, J. N. Hagstrom, 1988, Networks.

Computing the probability distribution of project duration in a PERT network

Jane N. Hagstrom, J. N. Hagstrom, 1990, Networks.

A New Algorithm for the Reliability Analysis of Multi-Terminal Networks

A. Satyanarayana, Jane N. Hagstrom, 1981, IEEE Transactions on Reliability.

Computing rooted communication reliability in an almost acyclic digraph

Jane N. Hagstrom, 1991, Networks.

System Reliability Analysis in the Presence of Dependent Component Failures

Jane N. Hagstrom, King-Tim Mak, 1987 .

Two-path Subsets: Efficient Counting and Applications to Performability Analysis

J. Scott Provan, Michael O. Ball, Jane N. Hagstrom, 1998, Discret. Appl. Math..

Combinatorial properties of directed graphs useful in computing network reliability

A. Satyanarayana, Jane N. Hagstrom, 1981, Networks.

Threshold reliability of networks with small failure sets

J. Scott Provan, Michael O. Ball, Jane N. Hagstrom, 1995, Networks.

Using the Decomposition-Tree of a Network in Reliability Computation

Jane N. Hagstrom, 1983, IEEE Transactions on Reliability.

Directed network reliability: Domination and computing coefficients of the success-marginal expansion

Jane N. Hagstrom, 1990, Networks.

Using the Decomposition Tree for Directed-Network Reliability Computation

Jane N. Hagstrom, 1984, IEEE Transactions on Reliability.

Maximum likelihood genetic sequence reconstruction from oligo content

Linus Schrage, Ross A. Overbeek, Morgan Price, 1994, Networks.

Improving Traffic Flows at No Cost

Jane N. Hagstrom, J. N. Hagstrom, R. Abrams, 2006 .

Traffic Equilibrium: Link Flows, Path Flows and Weakly/Strongly Acyclic Solutions

Paul Tseng, Jane N. Hagstrom, J. N. Hagstrom, 2001 .