Graphs, Networks, and Algorithms

@inproceedings{Jungnickel1980GraphsNA,
  title={Graphs, Networks, and Algorithms},
  author={Dieter Jungnickel},
  year={1980}
}
Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed 
Computing connected components of graphs
In this article, we represent an algorithm for finding connected elements in an undirected graph with n vertices based on adjacency matrix. Keywords : Connected Components, Adjacency Matrix, and
Bland ’ s rule for the Network Simplex Algorithm
TLDR
The rigorous proof of the result that Bland’s rule for network simplex algorithm prevent the cycling is given.
Generating connected acyclic digraphs uniformly at random
Balanced network flows. V. Cycle‐canceling algorithms
We discuss Anstee's approach for solving generalized matching problems by solving an ordinary flow problem on a balanced network first. We give a description of the algorithm which applies not only
Maximum flows in bipartite dynamic networks
In this paper we study maximum flow algorithms for stationary bipartite dynamic networks. In a bipartite static network the several maximum flow algorithms can be substantially improved. The basic
The topological drawing of a graph: Construction methods
This paper considers construction algorithms for the topological 2-D drawing of a graph. These algorithms allow to store, describe and modify the existing information on the drawing of a graph.
Extra pearls in graph theory
This is a supplement for "Pearls in graph theory" -- a textbook written by Nora Hartsfield and Gerhard Ringel. Probabilistic method, Deletion-contraction formulas, Matrix theorem, Graph-polynomials,
On some numerical characteristics of a bipartite graph
The paper considers an equivalence relation in the set of vertices of a bipartite graph.Some numerical characteristics showing the cardinality of equivalence classes are in-troduced. A combinatorial
TOPOLOGY OF COMPLEX NETWORKS: MODELS AND ANALYSIS
  • C. J. Carstens
  • Computer Science
    Bulletin of the Australian Mathematical Society
  • 2017
TLDR
There is a large variety of real-world phenomena that can be modelled and analysed as networks, but the differences between network classes are small.
...
...

References

SHOWING 1-4 OF 4 REFERENCES
@BULLET Vincent Limouzy Algorithmes de décomposition de graphes (MENRT)
  • @BULLET Vincent Limouzy Algorithmes de décomposition de graphes (MENRT)
A scalable contentaddressable network
    @BULLET Diego Perino Mesures dans Internet par et pour les réseaux decentralisés (CIFRE FranceTelecom
    • @BULLET Diego Perino Mesures dans Internet par et pour les réseaux decentralisés (CIFRE FranceTelecom
    Bibliography Year Publications Articles in refereed journals and book chapters
    • Bibliography Year Publications Articles in refereed journals and book chapters