Keywords
Computer scienceMathematics
Related Publications
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. ...
Massively Parallel Methods for Deep Reinforcement Learning
We present the first massively distributed architecture for deep reinforcement learning. This architecture uses four main components: parallel actors that generate new behaviour...
Dryad
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational "vertices" with communication "ch...
Incremental, iterative data processing with timely dataflow
We describe the timely dataflow model for distributed computation and its implementation in the Naiad system. The model supports stateful iterative and incremental computations....
A New Method of Locating the Maximum Point of an Arbitrary Multipeak Curve in the Presence of Noise
A versatile and practical method of searching a parameter space is presented. Theoretical and experimental results illustrate the usefulness of the method for such problems as t...
Publication Info
- Year
- 1969
- Type
- report
- Citations
- 4729
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
4729
OpenAlex
Cite This
Frank Harary
(1969).
GRAPH THEORY.
.
https://doi.org/10.21236/ad0705364
Identifiers
- DOI
- 10.21236/ad0705364