The following pages link to (Q3140399):
Displaying 50 items.
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Extracting backbones from weighted complex networks with incomplete information (Q304977) (← links)
- Fractional integral transform and application (Q304978) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Improving heuristics for network modularity maximization using an exact algorithm (Q406498) (← links)
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices (Q418346) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
- Bi-scale link prediction on networks (Q502939) (← links)
- Domino portrait generation: a fast and scalable approach (Q545542) (← links)
- A fast and efficient algorithm to identify clusters in networks (Q606725) (← links)
- Optimal assignment of resources to strengthen the weakest link in an uncertain environment (Q646646) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering (Q822870) (← links)
- Community detection via an efficient nonconvex optimization approach based on modularity (Q830497) (← links)
- Modularity-maximizing graph communities via mathematical programming (Q977873) (← links)
- Finding community structures in complex networks using mixed integer optimisation (Q978724) (← links)
- Graph representation for asymptotic expansion in homogenisation of nonlinear first-order equations (Q1042577) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- The (un)supervised NMF methods for discovering overlapping communities as well as hubs and outliers in networks (Q1619125) (← links)
- Imbalance problem in community detection (Q1619601) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Overlapping community detection using a generative model for networks (Q1673273) (← links)
- Personalized PageRank clustering: a graph clustering algorithm based on random walks (Q1673321) (← links)
- A new evidential methodology of identifying influential nodes in complex networks (Q1681656) (← links)
- Dominating complex networks by identifying minimum skeletons (Q1694056) (← links)
- Community detection in networks using new update rules for label propagation (Q1699635) (← links)
- Retracted article: ``A distance vector similarity metric for complex networks'' (Q1700992) (← links)
- Impulsive control of systems with network structure describing spread of political influence (Q1717422) (← links)
- A constrained power method for community detection in complex networks (Q1719174) (← links)
- Extracting co-occurrence relations from ZDDs (Q1736536) (← links)
- A greedy algorithm for neighborhood overlap-based community detection (Q1736758) (← links)
- Fast analytical methods for finding significant labeled graph motifs (Q1741244) (← links)
- Controllability and modularity of complex networks (Q1750332) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Optimal matching problem in detection and recognition performance evaluation (Q1860170) (← links)
- Density centrality: identifying influential nodes based on area density formula (Q2000310) (← links)
- A cooperative game framework for detecting overlapping communities in social networks (Q2148637) (← links)
- A framework for detecting communities of unbalanced sizes in networks (Q2149970) (← links)
- The Zipf-polylog distribution: modeling human interactions through social networks (Q2162912) (← links)
- Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
- Predator-prey games on complex networks (Q2207088) (← links)
- Outlier detection in networks with missing links (Q2242182) (← links)
- A weighted network community detection algorithm based on deep learning (Q2242706) (← links)
- Analyzing evolutionary optimization and community detection algorithms using regression line dominance (Q2293158) (← links)
