Jane N. Hagstrom

According to our database, Jane N. Hagstrom authored at least 9 papers between 1981 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1998

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

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

Discret. Appl. Math., 1998

1995

Threshold reliability of networks with small failure sets.

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

Networks, 1995

1994

Maximum likelihood genetic sequence reconstruction from oligo content.

Jane N. Hagstrom, Ray Hagstrom, Ross A. Overbeek, Morgan Price, Linus Schrage

Networks, 1994

1991

Computing rooted communication reliability in an almost acyclic digraph.

Jane N. Hagstrom

Networks, 1991

1990

Computing the probability distribution of project duration in a PERT network.

Jane N. Hagstrom

Networks, 1990

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

Jane Nichols Hagstrom

Networks, 1990

1988

Computational complexity of PERT problems.

Jane N. Hagstrom

Networks, 1988

1984

Note on independence of arcs in antiparallel for network flow problems.

Jane N. Hagstrom

Networks, 1984

1981

Combinatorial properties of directed graphs useful in computing network reliability.

A. Satyanarayana, Jane N. Hagstrom

Networks, 1981