• Publications
  • Influence
Network Reliability and Algebraic Structures
Overview of network reliability Approaches for calculating network reliability An algebraic formulation of network reliability problems Bounds on two-terminal reliability Enumeration of paths andExpand
  • 282
  • 33
An empirical investigation of some bicriterion shortest path algorithms
Abstract Several applications involve finding shortest paths in bicriterion networks: those in which each arc possesses two characteristics (such as time and cost). In these circumstances, it isExpand
  • 139
  • 8
A paradigm for listing (s, t)-cuts in graphs
TLDR
This paper studies the generation of various types of (s, t)-cuts in directed and undirected graphs. Expand
  • 44
  • 7
Analysis of pediatric blood lead levels in New York City for 1970-1976.
A study was completed of more than 170,000 records of pediatric venous blood levels and supporting demographic information collected in New York City during 1970-1976. The geometric mean (GM) bloodExpand
  • 70
  • 4
  • PDF
On algorithms for finding the k shortest paths in a network
  • D. Shier
  • Mathematics, Computer Science
  • Networks
  • 1 September 1979
  • 175
  • 4
Cut scheduling in the apparel industry
TLDR
A problem encountered in the apparel industry is that of producing, with no excess, a known number of different styles from the same cloth, without any excess garments. Expand
  • 33
  • 4
A Min-Max Theorem for p-Center Problems on a Tree
This paper considers the problem of locating p facilities on a tree network in order to minimize the maximum distance from a point on the network to its nearest facility. Such a problem might arise,Expand
  • 58
  • 3
Maximal chordal subgraphs
TLDR
An algorithm for finding maximal chordal subgraphs is developed that has worst-case time complexity of O(|E|Δ), where |E| is the number of edges in G and Δ is the maximum vertex degree in G. Expand
  • 35
  • 3
Some aspects of perfect elimination orderings in chordal graphs
  • D. Shier
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1 March 1984
TLDR
We study properties of perfect elimination orderings in chordal graphs and propose new schemes for generating them. Expand
  • 43
  • 3
Iterative algorithms for generating minimal cutsets in directed graphs
TLDR
Plusieurs approches pour evaluer la fiabilite d'un reseau necessitent de generer tous les ensembles de coupe minimaux dans un graphe oriente, et on propose pour cela un algorithme general iteratif, base sur une structure algebrique sous-jacente. Expand
  • 35
  • 2
...
1
2
3
4
5
...