GraphBase
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Scatter Search and Path Relinking: Advances and Applications
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering
- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- scientific article; zbMATH DE number 1643927 (Why is no real title available?)
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- Community detection via an efficient nonconvex optimization approach based on modularity
- Efficient data structures for sparse network representation
- M-centrality: identifying key nodes based on global position and local degree variation
- Solving the minimum-weighted coloring problem
- New approaches for optimizing over the semimetric polytope
- Improving heuristics for network modularity maximization using an exact algorithm
- Efficient methods for the distance-based critical node detection problem in complex networks
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
- The linear ordering problem: instances, search space analysis and algorithms
- Outlier detection in networks with missing links
- scientific article; zbMATH DE number 1870079 (Why is no real title available?)
- Domino portrait generation: a fast and scalable approach
- Computers and discovery in algebraic graph theory
- Extracting co-occurrence relations from ZDDs
- A greedy algorithm for neighborhood overlap-based community detection
- Correlation function for the grid-Poisson Euclidean matching on a line and on a circle
- COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY
- Density centrality: identifying influential nodes based on area density formula
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
- A Column Generation Approach for Graph Coloring
- Community detection by using the extended modularity
- Towards fast Vickrey pricing using constraint programming
- scientific article; zbMATH DE number 1185322 (Why is no real title available?)
- Experimenting with recursive queries in database and logic programming systems
- Imbalance problem in community detection
- The (un)supervised NMF methods for discovering overlapping communities as well as hubs and outliers in networks
- Modularity maximization using completely positive programming
- Link prediction via convex nonnegative matrix factorization on multiscale blocks
- Modular lazy search for constraint satisfaction problems
- A new evidential methodology of identifying influential nodes in complex networks
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- scientific article; zbMATH DE number 1974130 (Why is no real title available?)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Exact algorithms for the quadratic linear ordering problem
- Algorithms and experiments: The new (and old) methodology
- A weighted network community detection algorithm based on deep learning
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Extending and implementing the stable model semantics
- The Stanford GraphBase. A platform for combinatorial computing.
- Irredundant intervals
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- Correlation enhanced modularity-based belief propagation method for community detection in networks
- Controllability and observability of cascading failure networks
- A novel method of generating tunable network topologies for social simulation
- Path-based depth-first search for strong and biconnected components
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- A spectral method to detect community structure based on distance modularity matrix
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Extracting backbones from weighted complex networks with incomplete information
- Fractional integral transform and application
- Best practices for comparing optimization algorithms
- Multiple order local information model for link prediction in complex networks
- \(\mathsf{XRay}\): a Prolog technology theorem prover for default reasoning: a system description
- An experimental evaluation of a scatter search for the linear ordering problem
- A fast and efficient algorithm to identify clusters in networks
- GRIP: Graph Drawing with Intelligent Placement
- Semidefinite relaxations of ordering problems
- Practical performance of efficient minimum cut algorithms
- A cooperative game framework for detecting overlapping communities in social networks
- Simplicial SIRS epidemic models with nonlinear incidence rates
- SAT-based models for overlapping community detection in networks
- Finding communities in weighted networks through synchronization
- JGAP: a Java-based graph algorithms platform
- GNT
- LEDA
- MOLGEN
- INGRID
- PLATYPUS
- xQx
- NP-SPEC
- JGAP
- ABACUS
- Pajek
- OGDF
- Pajek datasets
- Blossom IV
- AutoGraphiX
- NoMoRe
- CPGraph
- Grappa
- visone
- GRIP
- LOLIB
- SOMbrero
- Ciao
- KONECT
- Open problems on graph eigenvalues studied with AutoGraphiX
- GraphGrep
- GRAPH
- CEoptim
- NodeTrix
- yasomi
- plfit
- AWK
This page was built for software: GraphBase
