scientific article

Publication date: 6 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2265/22650477.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (48)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Basic networks: definition and applications ⋮ Structural relatedness via flow networks in protein sequence space ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics ⋮ Generalized averaged Gauss quadrature rules for the approximation of matrix functionals ⋮ Exact computational solution of modularity density maximization by effective column generation ⋮ Link prediction via linear optimization ⋮ Short cycle connectivity ⋮ Identifying multiple influential spreaders by a heuristic clustering algorithm ⋮ Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes ⋮ The chaotic dynamics of the social behavior selection networks in crowd simulation ⋮ Estimating the trace of matrix functions with application to complex networks ⋮ Optimizing \(K^2\) trees: a case for validating the maturity of network of practices ⋮ Total Variation Based Community Detection Using a Nonlinear Optimization Approach ⋮ PROPERTIES OF AUTOSEMANTIC WORD NETWORKS IN UKRAINIAN TEXTS ⋮ Combinatorial algorithms for the maximum \(k\)-plex problem ⋮ Characterization of Graphs Using Degree Cores ⋮ Long-Range Interactions and Network Synchronization ⋮ G-Tries: a data structure for storing and finding subgraphs ⋮ Walking through protein sequence space ⋮ Solving vertex cover in polynomial time on hyperbolic random graphs ⋮ Fast algorithms for determining (generalized) core groups in social networks ⋮ An Adaptive Version of Brandes' Algorithm for Betweenness Centrality ⋮ A locally optimal hierarchical divisive heuristic for bipartite modularity maximization ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Reformulation of a model for hierarchical divisive graph modularity maximization ⋮ Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions ⋮ A spectral method for bipartizing a network and detecting a large anti-community ⋮ Clustering and community detection in directed networks: a survey ⋮ An efficient algorithm for link prediction in temporal uncertain social networks ⋮ Simplified anti-Gauss quadrature rules with applications in linear algebra ⋮ Efficient modularity density heuristics for large graphs ⋮ Network tools for tracing the dynamics of heart rate after cardiac transplantation ⋮ On exact solution approaches for the longest induced path problem ⋮ Orthogonal expansion of network functions ⋮ Epidemic spreading in metapopulation networks with heterogeneous infection rates ⋮ Modelling topic propagation over the Internet ⋮ Dynamics of knowledge-intensive production: An agency-structure framework ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor ⋮ Review of statistical network analysis: models, algorithms, and software ⋮ On the Power of Simple Reductions for the Maximum Independent Set Problem ⋮ Pajek ⋮ Network analysis of Zentralblatt MATH data ⋮ Generalized block anti-Gauss quadrature rules ⋮ Tree decompositions and social graphs ⋮ A Nonlinear Spectral Method for Core--Periphery Detection in Networks

Uses Software

This page was built for publication: