#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1992

2018

- This year (1)
- Last 5 years (2)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Bruce Hendrickson, Robert W. Leland
- Proceedings of the IEEE/ACM SC95 Conference
- 1995

The graph partitioning problem is that of dividing the vertices of a graph into sets of specified sizes such that few edges cross between sets. This NP-complete problem arises in many importantâ€¦ (More)

- Bruce Hendrickson
- SIAM J. Comput.
- 1992

The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of inter-vertex distance measurements. This paperâ€¦ (More)

- Jonathan E. Atkins, Erik G. Boman, Bruce Hendrickson
- SIAM J. Comput.
- 1998

In applications ranging from DNA sequencing through archeological dating to sparse matrix reordering, a recurrent problem is the sequencing of elements in such a way that highly correlated pairs ofâ€¦ (More)

Many important macroscopic properties of materials depend upon the number of microscopic degrees of freedom. The task of counting the number of such degrees of freedom can be computationally veryâ€¦ (More)

- Andrew Lumsdaine, Douglas P. Gregor, Bruce Hendrickson, Jonathan W. Berry
- Parallel Processing Letters
- 2007

Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel computing resourcesâ€¦ (More)

- Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Bruce Hendrickson, Courtenay T. Vaughan
- Computing in Science and Engineering
- 2002

- Jonathan W. Berry, Bruce Hendrickson, Simon Kahan, Petr Konecny
- 2007 IEEE International Parallel and Distributedâ€¦
- 2007

Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster-based computingâ€¦ (More)

- Andy B. Yoo, Edmond Chow, Keith W. Henderson, Will McLendon, Bruce Hendrickson, Ãœmit V. Ã‡atalyÃ¼rek
- ACM/IEEE SC 2005 Conference (SC'05)
- 2005

Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth- first search (BFS)â€¦ (More)

- Bruce Hendrickson, Robert W. Leland
- SIAM J. Scientific Computing
- 1995

Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. A new domain mappingâ€¦ (More)

- Bruce Hendrickson, Tamara G. Kolda
- Parallel Computing
- 2000

Calculations can naturally be described as graphs in which vertices represent computation and edges reeect data dependencies. By partitioning the vertices of a graph, the calculation can be dividedâ€¦ (More)