scientific article

Publication date: 13 February 1995

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

combinatorial algorithms Stanford GraphBase

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to computer science (68-04)

Related Items (84)

Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering ⋮ The (un)supervised NMF methods for discovering overlapping communities as well as hubs and outliers in networks ⋮ Imbalance problem in community detection ⋮ Detecting almost symmetries of graphs ⋮ JGAP: a Java-based graph algorithms platform ⋮ Community detection via an efficient nonconvex optimization approach based on modularity ⋮ Path-based depth-first search for strong and biconnected components ⋮ Extracting backbones from weighted complex networks with incomplete information ⋮ Fractional integral transform and application ⋮ Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ A cooperative game framework for detecting overlapping communities in social networks ⋮ A framework for detecting communities of unbalanced sizes in networks ⋮ The Zipf-polylog distribution: modeling human interactions through social networks ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Semidefinite relaxations of ordering problems ⋮ Detecting communities in networks using a Bayesian nonparametric method ⋮ Overlapping community detection using a generative model for networks ⋮ Personalized PageRank clustering: a graph clustering algorithm based on random walks ⋮ A fast and efficient algorithm to identify clusters in networks ⋮ Random networks are heterogeneous exhibiting a multi-scaling law ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ A new evidential methodology of identifying influential nodes in complex networks ⋮ An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs ⋮ Optimizing edge sets in networks to produce ground truth communities based on modularity ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ Improving heuristics for network modularity maximization using an exact algorithm ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ Dominating complex networks by identifying minimum skeletons ⋮ Optimizing \(K^2\) trees: a case for validating the maturity of network of practices ⋮ Crossing Minimization in Storyline Visualization ⋮ Mathematical programming formulations for the collapsed k-core problem ⋮ Community detection in networks using new update rules for label propagation ⋮ Retracted article: ``A distance vector similarity metric for complex networks ⋮ A spectral method to detect community structure based on distance modularity matrix ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ Predator-prey games on complex networks ⋮ Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy ⋮ Efficient data structures for sparse network representation ⋮ Optimal assignment of resources to strengthen the weakest link in an uncertain environment ⋮ Impulsive control of systems with network structure describing spread of political influence ⋮ A constrained power method for community detection in complex networks ⋮ Fast and Scalable Domino Portrait Generation ⋮ Reformulation of a model for hierarchical divisive graph modularity maximization ⋮ Extracting co-occurrence relations from ZDDs ⋮ A greedy algorithm for neighborhood overlap-based community detection ⋮ M-Centrality: identifying key nodes based on global position and local degree variation ⋮ A novel method of generating tunable network topologies for social simulation ⋮ Fast analytical methods for finding significant labeled graph motifs ⋮ Bi-scale link prediction on networks ⋮ Outlier detection in networks with missing links ⋮ A weighted network community detection algorithm based on deep learning ⋮ XRay: A prolog technology theorem prover for default reasoning: A system description ⋮ Controllability and modularity of complex networks ⋮ Solving the minimum-weighted coloring problem ⋮ Density centrality: identifying influential nodes based on area density formula ⋮ Domino portrait generation: a fast and scalable approach ⋮ Modularity-maximizing graph communities via mathematical programming ⋮ Finding community structures in complex networks using mixed integer optimisation ⋮ Variable neighborhood search for the linear ordering problem ⋮ Graphlet: design and implementation of a graph editor ⋮ Incremental bipartite drawing problem ⋮ Analyzing evolutionary optimization and community detection algorithms using regression line dominance ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Heuristics and meta-heuristics for 2-layer straight line crossing minimization ⋮ COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY ⋮ COMMUNITY FINDING IN COMPLEX NETWORKS ⋮ Prolog technology for default reasoning: proof theory and compilation techniques ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Simplicial SIRS epidemic models with nonlinear incidence rates ⋮ Graph representation for asymptotic expansion in homogenisation of nonlinear first-order equations ⋮ An order-based algorithm for minimum dominating set with application in graph mining ⋮ Crossing minimization in weighted bipartite graphs ⋮ Link prediction via convex nonnegative matrix factorization on multiscale blocks ⋮ Generic Constraint-based Block Modeling using Constraint Programming ⋮ New approaches for optimizing over the semimetric polytope ⋮ Computers and discovery in algebraic graph theory ⋮ Optimal matching problem in detection and recognition performance evaluation ⋮ Finding communities in weighted networks through synchronization ⋮ Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering ⋮ Extending and implementing the stable model semantics ⋮ Semi-supervised learning with regularized Laplacian ⋮ THE MAXIMUM COMMUNITY PARTITION PROBLEM IN NETWORKS

Uses Software

GraphBase

This page was built for publication: