GraphBase

swMATH1555MaRDI QIDQ14261FDOQ14261

Author name not available (Why is that?)

Official website: http://www.cs.sunysb.edu/~algorith/implement/graphbase/implement.shtml

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

• A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
• fastRG
• Efficient data structures for sparse network representation
• New approaches for optimizing over the semimetric polytope
• Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
• Efficient methods for the distance-based critical node detection problem in complex networks
• 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
• 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
• Link prediction via convex nonnegative matrix factorization on multiscale blocks
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Exact algorithms for the quadratic linear ordering problem
• 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
• Fast analytical methods for finding significant labeled graph motifs
• GNT
• LEDA
• An alternative method to crossing minimization on hierarchical graphs
• INGRID
• JGAP
• OGDF
• Blossom IV
• AutoGraphiX
• NoMoRe
• CPGraph
• Grappa
• visone
• GRIP
• LOLIB
• SOMbrero
• Ciao
• KONECT
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• GraphGrep
• GRAPH
• CEoptim
• NodeTrix
• yasomi
• plfit
• AWK
• ProdSumNet
• MDL4BMF
• xray
• missSBM
• NeMoFinder
• FindAlmostSymmetry
• zipfextR
• An open graph visualization system and its applications to software engineering
• gsbm
• SybilRadar
• Incremental bipartite drawing problem
• Reformulation of a model for hierarchical divisive graph modularity maximization
• 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
• 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
• sbm
• Detecting almost symmetries of graphs
• 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
• 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
• M-centrality: identifying key nodes based on global position and local degree variation
• Community detection via an efficient nonconvex optimization approach based on modularity
• Solving the minimum-weighted coloring problem
• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
• Title not available (Why is that?)
• Computers and discovery in algebraic graph theory
• Correlation function for the grid-Poisson Euclidean matching on a line and on a circle
• 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
• Experimenting with recursive queries in database and logic programming systems

This page was built for software: GraphBase