DIAMETER ROUTING AGENT
-
Updated
Apr 8, 2024
DIAMETER ROUTING AGENT
tool to analyze tree measurements and calculate metrics like diameter growth and forest increase in individual trees and different species and plots.
Presenting potential linear O(M) Diamter finding algorithm with worst case O(m * n). This is simply a C++ implementation of this iFUB algorithm.
3GPP AAA Server
Graph Theory Algorithms Implementation
Comparing algorithms for the computation of the diameter of directed and weakly connected graphs
Equipment Identity Register
Extremal small polygons
C++ tools focused on Diameter Protocol (RFC 6733) - WORK IN PROGRESS
Istio Mixer adapter for Kubernetes cluster integration with OCS
C++ codec library for Diameter Protocol (RFC 6733) - WORK IN PROGRESS
Utility for quickly generating XML and ASN.1 dictionaries for Diameter protocol
Random graphs help in analyzing complex networks. In a random graph, the quantities of nodes and arcs are random variables defined according to a given probabilistic model. In this project we will explore properties of undirected random graphs in the Erdos Renyl model.
Add a description, image, and links to the diameter topic page so that developers can more easily learn about it.
To associate your repository with the diameter topic, visit your repo's landing page and select "manage topics."