GraphBase

No author found.

Related Items (only showing first 100 items - show all)

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 ⋮ Modularity maximization using completely positive programming ⋮ Detecting almost symmetries of graphs ⋮ Community detection via an efficient nonconvex optimization approach based on modularity ⋮ Path-based depth-first search for strong and biconnected components ⋮ Exact Algorithms for the Quadratic Linear Ordering Problem ⋮ Essentials of Programming in Mathematica® ⋮ Complex networks. Papers from the conference `complex networks: structure, dynamics, and function', 23rd annual conference of the Center for Nonlinear Studies, Santa Fe, NM, USA, May 12--16, 2003. ⋮ Extracting backbones from weighted complex networks with incomplete information ⋮ Fractional integral transform and application ⋮ Multiple order local information model for link prediction in complex networks ⋮ Best practices for comparing optimization algorithms ⋮ A cooperative game framework for detecting overlapping communities in social networks ⋮ Unnamed Item ⋮ A framework for detecting communities of unbalanced sizes in networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Zipf-polylog distribution: modeling human interactions through social networks ⋮ Unnamed Item ⋮ 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 ⋮ The linear ordering problem. Exact and heuristic methods in combinatorial optimization. ⋮ A new evidential methodology of identifying influential nodes in complex networks ⋮ The Open Graph Archive: A Community-Driven Effort ⋮ Unnamed Item ⋮ Improving heuristics for network modularity maximization using an exact algorithm ⋮ Dominating complex networks by identifying minimum skeletons ⋮ Enhancing DLV instantiator by backjumping techniques ⋮ Optimizing \(K^2\) trees: a case for validating the maturity of network of practices ⋮ Community detection in networks using new update rules for label propagation ⋮ Retracted article: ``A distance vector similarity metric for complex networks ⋮ 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 ⋮ Efficient data structures for sparse network representation ⋮ Optimal assignment of resources to strengthen the weakest link in an uncertain environment ⋮ Unnamed Item ⋮ Impulsive control of systems with network structure describing spread of political influence ⋮ A constrained power method for community detection in complex networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions ⋮ An Alternative Method to Crossing Minimization on Hierarchical Graphs ⋮ Practical performance of efficient minimum cut algorithms ⋮ Unnamed Item ⋮ Discovering link communities in complex networks by exploiting link dynamics ⋮ Unnamed Item ⋮ Reformulation of a model for hierarchical divisive graph modularity maximization ⋮ Extracting co-occurrence relations from ZDDs ⋮ Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle ⋮ A greedy algorithm for neighborhood overlap-based community detection ⋮ Correlation enhanced modularity-based belief propagation method for community detection in networks ⋮ Controllability and observability of cascading failure networks ⋮ 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 ⋮ Outlier detection in networks with missing links ⋮ A weighted network community detection algorithm based on deep learning ⋮ Controllability and modularity of complex networks ⋮ Solving the minimum-weighted coloring problem ⋮ Modular lazy search for Constraint Satisfaction Problems ⋮ Density centrality: identifying influential nodes based on area density formula ⋮ Domino portrait generation: a fast and scalable approach ⋮ Towards fast Vickrey pricing using constraint programming ⋮ Unnamed Item ⋮ Modularity-maximizing graph communities via mathematical programming ⋮ Finding community structures in complex networks using mixed integer optimisation ⋮ The linear ordering problem: instances, search space analysis and algorithms ⋮ Variable neighborhood search for the linear ordering problem ⋮ A New Exact Algorithm for the Two-Sided Crossing Minimization Problem ⋮ The landscape of complex networks -- critical nodes and a hierarchical decomposition ⋮ Analyzing evolutionary optimization and community detection algorithms using regression line dominance ⋮ Simple and Efficient Bilayer Cross Counting ⋮ Experiments with the Fixed-Parameter Approach for Two-Layer Planarization ⋮ 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 ⋮ Prolog technology for default reasoning: proof theory and compilation techniques ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Community Detection by using the Extended Modularity ⋮ Performance Estimation Using Symbolic Data ⋮ Dominating communities for hierarchical control of complex networks ⋮ 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 ⋮ SAT-based models for overlapping community detection in networks ⋮ Link prediction via convex nonnegative matrix factorization on multiscale blocks ⋮ An experimental evaluation of a scatter search for the linear ordering problem ⋮ New approaches for optimizing over the semimetric polytope ⋮ Computers and discovery in algebraic graph theory ⋮ Optimal matching problem in detection and recognition performance evaluation ⋮ Extending and implementing the stable model semantics

This page was built for software: GraphBase