This document discusses various techniques for visualizing networks, including different layout algorithms. It begins by defining what a network is as a data structure of entities and relationships. It then covers topics like matrix representations, arc/linear layouts, circular/chord layouts, and hierarchical edge bundling. It also discusses simple network measures like degree and betweenness centrality that can provide insight into a network's structure. The document provides many examples and references to external resources on network visualization.