Network Analysis
From MaRDI portal
Publication:5703978
DOI10.1007/b106453zbMath1118.68330OpenAlexW4248776151MaRDI QIDQ5703978
Dirk Koschützki, Stefan Richter, Oliver Zlotowski, Leon Peeters, Dagmar Tenfelde-Podehl, Katharina A. Zweig
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106453
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (32)
Analyzing the maritime transportation system in Greece: a complex network approach ⋮ Crisp and fuzzy motif and arrangement symmetries in composite geometric figures ⋮ Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ On resilient graph spanners ⋮ Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them ⋮ Hidden symmetries in real and theoretical networks ⋮ On decay centrality in graphs ⋮ ‘Too central to fail’ firms in bi-layered financial networks: linkages in the US corporate bond and stock markets ⋮ Eccentricity terrain of \(\delta\)-hyperbolic graphs ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ Re-conceptualizing centrality in social networks ⋮ Dimension reduction in the topology of multilayer spatial networks: the case of the interregional commuting in Greece ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Searchability of central nodes in networks ⋮ Structural analysis of metabolic networks based on flux centrality ⋮ Numerical Study on the Efficiency of Magnetophoresis in Human Vasculature like Conditions ⋮ Unnamed Item ⋮ Analyzing complex networks through correlations in centrality measurements ⋮ Efficient algorithms for updating betweenness centrality in fully dynamic graphs ⋮ Directionality of real world networks as predicted by path length in directed and undirected graphs ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ Restricted cooperative games on metabolic networks reveal functionally important reactions ⋮ PageRank Beyond the Web ⋮ Efficient Computation of Time-Dependent Centralities in Air Transportation Networks ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Attachment centrality: measure for connectivity in networks ⋮ Eccentricity function in distance-hereditary graphs ⋮ An integer programming approach for finding the most and the least central cliques ⋮ Group centralization of network indices
This page was built for publication: Network Analysis