Search Results - "Provan, J. Scott"

DISJOINT PRODUCTS AND EFFICIENT COMPUTATION OF RELIABILITY.

Authors: Ball, Michael O. Provan, J. Scott

Source: Operations Research. Sep/Oct1988, Vol. 36 Issue 5, p703. 13p. 1 Diagram, 1 Chart, 1 Graph.

Computing Network Reliability in Time Polynomial in the Number of Cuts.

Authors: Provan, J. Scott Ball, Michael O.

Source: Operations Research. May/Jun1984, Vol. 32 Issue 3, p516. 11p.

CALCULATING K-CONNECTEDNESS RELIABILITY USING STEINER BOUNDS.

Authors: Chari, Manoj K. Provan, J. Scott

Source: Mathematics of Operations Research (INFORMS). Nov96, Vol. 21 Issue 4, p905. 17p. 1 Diagram, 2 Charts, 2 Graphs.

POLYHEDRAL COMBINATORICS AND NETWORK RELIABILITY.

Authors: Provan, J. Scott

Source: Mathematics of Operations Research (INFORMS). Feb86, Vol. 11 Issue 1, p36-61. 26p.

LEONTIEF SUBSTITUTION SYSTEMS AND MATROID COMPLEXES.

Authors: Provan, J. Scott Billera, Louis J.

Source: Mathematics of Operations Research (INFORMS). Feb82, Vol. 7 Issue 1, p81-87. 7p.

DECOMPOSITION OF SIMPLICIAL COMPLEXES RELATED TO DIAMETERS OF CONVEX POLYHEDRA.

Authors: Provan, J. Scott Billera, Louis J.

Source: Mathematics of Operations Research (INFORMS). Nov80, Vol. 5 Issue 4, p576-594. 19p.

DELTA-WYE TRANSFORMATIONS AND THE EFFICIENT REDUCTION OF TWO-TERMINAL PLANAR GRAPHS.

Authors: Feo, Thomas A. Provan, J. Scott

Source: Operations Research. May/Jun1993, Vol. 41 Issue 3, p572. 11p. 10 Diagrams.

An approximation scheme for finding Steiner trees with obstacles.

Authors: Provan, J. Scott

Source: SIAM Journal on Computing; October 1988, Vol. 17, p920-934, 15p

The complexity of reliability computations in planar and acyclic graphs.

Authors: Provan, J. Scott

Source: SIAM Journal on Computing; August 1986, Vol. 15, p694-702, 9p

The complexity of counting cuts and of computing the probability that a graph is connected.

Authors: Provan, J. Scott Ball, Michael O.

Source: SIAM Journal on Computing; November 1983, Vol. 12, p777-788, 12p

Sudoku: Strategy versus Structure.

Authors: Provan, J. Scott¹ Scott•Provan@UNC.edu

Source: American Mathematical Monthly. Oct2009, Vol. 116 Issue 8, p702-707. 6p.

THE ROLE OF STEINER HULLS IN THE SOLUTION TO STEINER TREE PROBLEMS.

Authors: Provan, J. Scott¹

Source: Annals of Operations Research. 1991, Vol. 33 Issue 1-4, p537-548. 12p. 3 Diagrams.

Subjects: Steiner systems, Block designs, Decision trees, Decision making, Mathematical models, Euclidean algorithm, Operations research, Decision theory, Mathematical programming

COUNTING PROBLEMS ASSOCIATED WITH STEINER TREES IN GRAPHS.

Authors: Provan, J. Scott Chari, Manoj K.

Source: SIAM Journal on Discrete Mathematics. 1997, Vol. 10 Issue 3, p436-446. 11p.

Subjects: Graph theory, Tree graphs, Computational mathematics, Combinatorics

The Delta-Wye Approximation Procedure (DWAP) for two-terminal reliability.

Authors: Chari, Manoj K. Feo, Thomas A. Provan, J. Scott

Source: Operations Research. Sep/Oct1996, Vol. 44 Issue 5, p745. 13p. 8 Diagrams, 4 Charts, 5 Graphs.

Polyhedral computational geometry for averaging metric phylogenetic trees.

Authors: Miller, Ezra Owen, Megan Provan, J. Scott

Source: Advances in Applied Mathematics. Jul2015, Vol. 68, p51-91. 41p.

Subjects: Polyhedra models, Computational geometry, Phylogeny, Tree graphs, Analysis of variance

A fast algorithm for computing geodesic distances in tree space.

Authors: Owen M Provan JS

Source: IEEE/ACM transactions on computational biology and bioinformatics [IEEE/ACM Trans Comput Biol Bioinform] 2011 Jan-Mar; Vol. 8 (1), pp. 2-13.

Publication Type: Journal Article; Research Support, U.S. Gov't, Non-P.H.S.

Journal Info: Publisher: IEEE Computer Society Country of Publication: United States NLM ID: 101196755 Publication Model: Print Cited Medium: Internet ISSN: 1557-9964 (Electronic) Linking ISSN: 15455963 NLM ISO Abbreviation: IEEE/ACM Trans Comput Biol Bioinform Subsets: MEDLINE