|
S O C I A L N E T W O R K S & N E T W O R K A D M I N I S T R A T I O N
EXAMPLE
APPLICATION: Social Networks
A company located in Montana, USA,
maintains
a network of experts on all economic and scientific fields.
Each member of this group is constantly rated with respect to its
suitability and relevance regarding specific problem domains. Whenever
a member of the network formulates a problem, the optimal person
to contact shall be automatically determined. This has to be done
by a software system that must handle both the network maintenance
and the entire dynamic rating process.
Problem Domain:
- Graph
and network algorithms
Required:
- Suited
data structures in order to maintain and manipulate
the network.
- Dynamic rating algorithms.
SOLUTION:
- LEDA's data type graph and
its related graph algorithms.
Visualize Social Networks
Many information on a specific
social network can easily be identified by just looking at a good
visualization of the entities and relationships. Cliques, small
worlds, but also values such as diameter, or importance can quite
often be estimated immediately if the layout method for the diagram
is well chosen.
The graph data type provides a straightforward tool for modeling
social networks. Many relevant questions like computing diameter,
importance, centrality, finding small worlds, cliques, structural
equivalence and many more can easily be anwsered by either using
the available graph and network algorithms of LEDA or building new
but short programs on top of the existing functionality.
Visualize And Manage
Your Network
Use the available grafical user interface and visualization
capabilities of LEDA to view and interactively modify your communication
network.
Improve Runtimes
On Large Networks
To improve running times is easy - simply
use LEDA's static graph feature and improve space requirements by
up to 60 and running times by up to 70 percent!
Read more
about our Static Graphs.
LINKS
LEDA
LEDA
extension package: GraphML
LEDA Tutorial
|