GraphBase
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Graph representation for asymptotic expansion in homogenisation of nonlinear first-order equations
- Crossing minimization in weighted bipartite graphs
- Prolog technology for default reasoning: proof theory and compilation techniques
- GNT
- LEDA
- MOLGEN
- Rclust
- sbm
- fastRG
- INGRID
- PLATYPUS
- xQx
- NP-SPEC
- JGAP
- ABACUS
- Extending and implementing the stable model semantics
- Pajek
- 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
- OGDF
- Pajek datasets
- Best practices for comparing optimization algorithms
- Overlapping community detection using a generative model for networks
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- A new evidential methodology of identifying influential nodes in complex networks
- Dominating complex networks by identifying minimum skeletons
- Blossom IV
- Community detection in networks using new update rules for label propagation
- Retracted article: ``A distance vector similarity metric for complex networks
- Impulsive control of systems with network structure describing spread of political influence
- A constrained power method for community detection in complex networks
- Extracting co-occurrence relations from ZDDs
- A greedy algorithm for neighborhood overlap-based community detection
- Fast analytical methods for finding significant labeled graph motifs
- Controllability and modularity of complex networks
- The linear ordering problem: instances, search space analysis and algorithms
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- AutoGraphiX
- An experimental evaluation of a scatter search for the linear ordering problem
- Computers and discovery in algebraic graph theory
- Optimal matching problem in detection and recognition performance evaluation
- 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.
- NoMoRe
- Practical performance of efficient minimum cut algorithms
- Density centrality: identifying influential nodes based on area density formula
- CPGraph
- Multiple order local information model for link prediction in complex networks
- 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
- Predator-prey games on complex networks
- Outlier detection in networks with missing links
- A weighted network community detection algorithm based on deep learning
- Grappa
- Analyzing evolutionary optimization and community detection algorithms using regression line dominance
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Link prediction via convex nonnegative matrix factorization on multiscale blocks
- visone
- Enhancing DLV instantiator by backjumping techniques
- LOLIB
- GRIP
- Variable neighborhood search for the linear ordering problem
- The landscape of complex networks -- critical nodes and a hierarchical decomposition
- New approaches for optimizing over the semimetric polytope
- Random networks are heterogeneous exhibiting a multi-scaling law
- Efficient methods for the distance-based critical node detection problem in complex networks
- SOMbrero
- An alternative method to crossing minimization on hierarchical graphs
- Extending the Smodels system with cardinality and weight constraints
- Algorithms and experiments: The new (and old) methodology
- scientific article; zbMATH DE number 1643927 (Why is no real title available?)
- Solving the minimum-weighted coloring problem
- Modular lazy search for constraint satisfaction problems
- scientific article; zbMATH DE number 1706372 (Why is no real title available?)
- Using SOMbrero for clustering and visualizing graphs
- Performance estimation using symbolic data
- Ciao
- Exact algorithms for the quadratic linear ordering problem
- KONECT
- Detecting communities in networks using a Bayesian nonparametric method
- Path-based depth-first search for strong and biconnected components
- Extracting backbones from weighted complex networks with incomplete information
- Fractional integral transform and application
- GraphGrep
- GRAPH
- Prioritization methods for accelerating MDP solvers
- Efficient parallel ASP instantiation via dynamic rewriting
- Community detection by using the extended modularity
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- NodeTrix
- CEoptim
- The Open Graph Archive: a community-driven effort
- yasomi
- Discovering link communities in complex networks by exploiting link dynamics
- Correlation function for the grid-Poisson Euclidean matching on a line and on a circle
- 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
This page was built for software: GraphBase
