Operations research
•
Graph theory
•
Network
•
Graph algorithms
•
Network science
•
List of algorithms
Network Theory in Risk Assessment
Network theory
In computer and network science, network theory is the study of graphs as a representation of either symmetric relations or, more generally, of asymmetric relations between discrete objects. Network t...
Network theory - Wikipedia
Combinatorial optimization
•
Network analysis
•
Network flow
How to create an app like TikTok: Features, Business Model, Cost
This guide will tell you how to adopt a TikTok success pattern and develop a social media app.
Social Network Algorithms Are Distorting Reality By Boosting Conspiracy Theories
Talk of Facebook's anticonservative stance is in the news, but the issue of what news social networks choose to show us is much broader than that...
Happiness and Sadness Spread Just Like Disease
There may be a literal truth underlying the common-sense intuition that happiness and sadness are contagious. A new study on the spread of emotions through social networks shows that these feelings ci...
Social Network Size Linked to Brain Size - Scientific American
How and why the volume of the orbital prefrontal cortex is related to the size of social networks
Social network
http://www.socialnomics.net/ Part of the world's most watched Social Media video series; Social Media Revolution by Erik Qualman. Based on 1 International...
Combinatorial optimization
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects. In many such problems, exhausti...
Network analysis
Network analysis can refer to:
Network flow
Network flow may refer to:
How to create an app like TikTok: Features, Business Model, Cost
This guide will tell you how to adopt a TikTok success pattern and develop a social media app.
Agent Network Topology
Topological theory of intelligent agent networks provides crucial information about the structure of agent distribution over a network. Agent network topologies not only take agent distribution into c...
NetPoint
NetPoint is a graphically-oriented project planning and scheduling software application first released for commercial use in 2009. The application uses a time-scaled activity network diagram to facili...
NetPoint - Wikipedia
Cut (graph theory)
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint in each subset of the partition. These...
Complex network zeta function
Different definitions have been given for the dimension of a complex network or graph. For example, metric dimension is defined in terms of the resolving set for a graph. Dimension has also been defi...
EasyLocal++
EasyLocal++ is a framework for modeling and solving combinatorial optimization problems through local search metaheuristics. The framework (currently at version 3.0) is entirely written in C++ (C++11)...
HITS algorithm
Hyperlink-Induced Topic Search (HITS; also known as hubs and authorities) is a link analysis algorithm that rates Web pages, developed by Jon Kleinberg. The idea behind Hubs and Authorities stemmed fr...
Linear scheduling method
Linear Scheduling Method (LSM) is a graphical scheduling method focusing on continuous resource utilization in repetitive activities. It is believed (see Harris and McCaffer 2006:79*) that it original...
Degree distribution
In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees o...
Degree distribution - Wikipedia
Sequence step algorithm
A sequence step algorithm (SQS-AL) is an algorithm implemented in a discrete event simulation system to maximize resource utilization. This is achieved by running through two main nested loops: A sequ...
Network scheduler
On a node in packet switching communication network, a network scheduler, also called packet scheduler, is an arbiter program that manages the sequence of network packets in the transmit and receive q...
Graphical path method
The Graphical Path Method (GPM) is a mathematically based algorithm used in project management for planning, scheduling and resource control. GPM represents logical relationships of dated objects – s...
Gomory–Hu tree
In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that represents the minimum s-t cuts for all s-t pairs in the graph. The Gomory–Hu tree can ...
Gomory–Hu tree - Wikipedia
SALSA algorithm
Stochastic Approach for Link-Structure Analysis (SALSA) is a web page ranking algorithm designed by R. Lempel and S. Moran to assign high scores to hub and authority web pages based on the quanti...
SALSA algorithm - Wikipedia
Hungarian algorithm
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal-dual methods. It was developed and published in ...
Circulation problem
The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the...
BuzzFeed
BuzzFeed is an American Internet news media company. Founded in 2006 in New York City as a viral lab by Jonah Peretti, the company has grown into a global media and technology company providing covera...
Subadditive set function
In mathematics, a subadditive set function is a set function whose value, informally, has the property that the value of function on the union of two sets is at most the sum of values of the function ...
Fitness model (network theory)
In complex network theory, the fitness model is a model of the evolution of a network: how the links between nodes change over time depends on the fitness of nodes. Fitter nodes attract more links at ...
Complex network
In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but...
Clustering coefficient
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social ne...
Clustering coefficient - Wikipedia
CheiRank
The CheiRank is an eigenvector with a maximal real eigenvalue of the Google matrix constructed for a directed network with the inverted directions of links. It is similar to the PageRank vector, whi...
CheiRank - Wikipedia