GraphBase

swMATH1555MaRDI QIDQ14261FDOQ14261

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Efficient data structures for sparse network representation
• Community detection via an efficient nonconvex optimization approach based on modularity
• New approaches for optimizing over the semimetric polytope
• Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
• Efficient methods for the distance-based critical node detection problem in complex networks
• Title not available (Why is that?)
• Improving heuristics for network modularity maximization using an exact algorithm
• Outlier detection in networks with missing links
• The linear ordering problem: instances, search space analysis and algorithms
• Computers and discovery in algebraic graph theory
• Domino portrait generation: a fast and scalable approach
• A Column Generation Approach for Graph Coloring
• Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
• Towards fast Vickrey pricing using constraint programming
• Link prediction via convex nonnegative matrix factorization on multiscale blocks
• Title not available (Why is that?)
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Exact algorithms for the quadratic linear ordering problem
• Algorithms and experiments: The new (and old) methodology
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Title not available (Why is that?)
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• Extending and implementing the stable model semantics
• Path-based depth-first search for strong and biconnected components
• 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
• GRIP: Graph Drawing with Intelligent Placement
• An experimental evaluation of a scatter search for the linear ordering problem
• A fast and efficient algorithm to identify clusters in networks
• Practical performance of efficient minimum cut algorithms
• Semidefinite relaxations of ordering problems
• JGAP: a Java-based graph algorithms platform
• Title not available (Why is that?)
• SAT-based models for overlapping community detection in networks
• Open problems on graph eigenvalues studied with AutoGraphiX
• Fast analytical methods for finding significant labeled graph motifs
• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
• An alternative method to crossing minimization on hierarchical graphs
• Detecting communities in networks using a Bayesian nonparametric method
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• An open graph visualization system and its applications to software engineering
• Optimal matching problem in detection and recognition performance evaluation
• Prolog technology for default reasoning: proof theory and compilation techniques
• Incremental bipartite drawing problem
• 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.
• Dominating communities for hierarchical control of complex networks
• Reformulation of a model for hierarchical divisive graph modularity maximization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variable neighborhood search for the linear ordering problem
• Finding community structures in complex networks using mixed integer optimisation
• Modularity-maximizing graph communities via mathematical programming
• Optimal assignment of resources to strengthen the weakest link in an uncertain environment
• An order-based algorithm for minimum dominating set with application in graph mining
• Extending the Smodels system with cardinality and weight constraints
• COMMUNITY FINDING IN COMPLEX NETWORKS
• Prioritization methods for accelerating MDP solvers
• Semi-supervised learning with regularized Laplacian
• Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
• Constraint satisfaction algorithms for graph pattern matching
• Controllability and modularity of complex networks
• Detecting almost symmetries of graphs
• Detecting Hierarchical Communities in Networks: A New Approach
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
• Title not available (Why is that?)
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization
• Simple and Efficient Bilayer Cross Counting
• Scatter Search and Path Relinking: Advances and Applications
• Solving the minimum-weighted coloring problem
• Essentials of Programming in Mathematica®
• COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY
• Extracting co-occurrence relations from ZDDs
• A greedy algorithm for neighborhood overlap-based community detection
• Density centrality: identifying influential nodes based on area density formula
• Community detection by using the extended modularity
• Title not available (Why is that?)
• 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
• Modular lazy search for constraint satisfaction problems
• A new evidential methodology of identifying influential nodes in complex networks
• Irredundant intervals
• A weighted network community detection algorithm based on deep learning
• Generic Constraint-based Block Modeling using Constraint Programming
• The Stanford GraphBase. A platform for combinatorial computing.
• 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
• Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy
• A spectral method to detect community structure based on distance modularity matrix
• M-Centrality: identifying key nodes based on global position and local degree variation

This page was built for software: GraphBase