Ulrik Brandes spends much of his time researching Theoretical computer science, Graph drawing, Centrality, Network theory and Betweenness centrality. His Theoretical computer science research incorporates elements of Machine learning, Graph, Computation and Graph. His Graph drawing study incorporates themes from Social network analysis, Data visualization and Electronic data interchange.
Betweenness centrality is a component of his Katz centrality and Random walk closeness centrality studies. Ulrik Brandes interconnects Alpha centrality and Network controllability in the investigation of issues within Katz centrality. His biological study spans a wide range of topics, including Binary logarithm, Measure, Girvan–Newman algorithm and Range.
His primary areas of study are Theoretical computer science, Graph drawing, Combinatorics, Graph and Graph. The Theoretical computer science study combines topics in areas such as Betweenness centrality, Centrality, Graph Layout and Algorithm, Computation. His Betweenness centrality research focuses on Katz centrality and Random walk closeness centrality.
The Graph drawing study which covers Force-directed graph drawing that intersects with Lattice graph. His work focuses on many connections between Combinatorics and other disciplines, such as Discrete mathematics, that overlap with his field of interest in Tree. His research investigates the link between Graph and topics such as Cluster analysis that cross with problems in Graph partition.
His main research concerns Centrality, Algorithm, Network science, Theoretical computer science and Graph. His Centrality research incorporates themes from Discrete mathematics and Network theory. His biological study deals with issues like Duality, which deal with fields such as Combinatorics.
His Algorithm study combines topics from a wide range of disciplines, such as Space, Embedding, Preprocessor and Aggregate. His Theoretical computer science research is multidisciplinary, relying on both Sampling, Network model, Computation and Subroutine. He has researched Graph in several fields, including Model of computation and Graph.
The scientist’s investigation covers issues in Centrality, Katz centrality, Betweenness centrality, Network theory and Random walk closeness centrality. His Katz centrality research includes elements of Axiom, Conceptual framework and Correlation. To a larger extent, Ulrik Brandes studies Combinatorics with the aim of understanding Betweenness centrality.
His work carried out in the field of Random walk closeness centrality brings together such families of science as Star, Property, Generalization and Pairwise comparison. His study looks at the intersection of Network controllability and topics like Topology with Theoretical computer science. His Theoretical computer science study integrates concerns from other disciplines, such as Basis, Social network analysis and Graph drawing, Graph embedding, Graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A faster algorithm for betweenness centrality
Journal of Mathematical Sociology (2001)
Network Analysis: Methodological Foundations
Ulrik Brandes;Thomas Erlebach.
On Modularity Clustering
U. Brandes;D. Delling;M. Gaertler;R. Gorke.
IEEE Transactions on Knowledge and Data Engineering (2008)
On variants of shortest-path betweenness centrality and their generic computation ☆
Social Networks (2008)
Analysis and Visualization of Social Networks.
Ulrik Brandes;Dorothea Wagner.
graph drawing (2004)
Experiments on Graph Clustering Algorithms
Ulrik Brandes;Marco Gaertler;Dorothea Wagner.
european symposium on algorithms (2003)
Centrality measures based on current flow
Ulrik Brandes;Daniel Fleischer.
symposium on theoretical aspects of computer science (2005)
Centrality Estimation in Large Networks
Ulrik Brandes;Christian Pich.
International Journal of Bifurcation and Chaos (2007)
GraphML Progress Report Structural Layer Proposal
Ulrik Brandes;Markus Eiglsperger;Ivan Herman;Michael Himsolt.
graph drawing (2001)
Efficient generation of large random networks.
Vladimir Batagelj;Ulrik Brandes.
Physical Review E (2005)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: