Pajek - Program for Large Network Analysis
Published 1 January 1999
Vladimir Batagelj, Andrej Mrvar
Citations1,397
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Some approaches to analysis and visualisation of large networks implemented in programPajek are presented and some typical examples are also given.
Abstract
Large networks, having thousands of vertices and lines, can be found in many different areas, e. g: genealogies, flo w graphs of programs, molecule, computer networks, transportation networks, social networks, intra/inter organisational networks ... Many standard network algorithms are very time and space consuming and therefore unsuitable for analysis of such networks. In the article we present some approaches to analysis and visualisation of large networks implemented in programPajek. Some typical examples are also given.
Keywords
Computer SciencePhysics and Astronomy
The Design and Analysis of Computer Algorithms
9,456 Citations1974Alfred V. Aho, John E. Hopcroft
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Software Practice and ExperienceGraph drawing by force‐directed placement
6,359 Citations1991Thomas M. J. Fruchterman, Edward M. Reingold
A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Information Processing LettersAn algorithm for drawing general undirected graphs
2,771 Citations1989Tomihisa Kamada, Satoru Kawai
Society for Industrial and Applied Mathematics eBooksData Structures and Network Algorithms
2,067 Citations1983Robert E. Tarjan
This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
Contemporary Sociology A Journal of ReviewsCommunication Networks: Toward a New Paradigm for Research.
1,310 Citations1982Scott L. Feld, Everett M. Rogers +1 more
Social NetworksConnectivity in a citation network: The development of DNA theory
821 Citations1989Norman P. Hummon, Patrick Dereian
This work proposes a quite different approach to citation networks where the connective threads through a network are preserved and the focus is on the links in the network rather than on the nodes.
Structured testing :
318 Citations1996Dolores R Wallace, Arthur H. Watson +1 more
This document summarizes current capabilities, research and operational priorities, and plans for further studies that were established at the 2015 USGS workshop on quantitative hazard assessments of earthquake-triggered landsliding and liquefaction in the Central American region.
KnowledgeAnalyzing the Structure of the Centrality-Productivity Literature Created Between 1948 and 1979
91 Citations1990Norman P. Hummon, Patrick Doreian +1 more
Social NetworksComputational methods for social network analysis
68 Citations1990Norman P. Hummon, Patrick Doreian
This paper describes how to use depth first search based algorithms and linked list data structures for analyzing the connectivity of social networks, and proposes new measures of connectivity, and uses these measures to identify structural properties of networks that capture theConnectivity of the network.
Social NetworksKinship networks and discrete structure theory: Applications and implications
62 Citations1996Dougľas R. White, Paul Jorion
Journal of Mathematical SociologyPartitioning networks based on generalized concepts of equivalence
53 Citations1994Patrick Doreian, Vladimir Batagelj +1 more
It is argued that once committed to a specific form of equivalence, a network analyst must be committed also to an explicit method of assessing the extent to which a blockmodel is consistent with the selected form of interchangeability.