Algorithm 457
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- On maximal cliques with connectivity constraints in directed graphs
- Standardization of the input data in classification problems using the descent vector method
- Subgraph isomorphism, matching relational structures and maximal cliques
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- On identifying dominant cliques.
- Lower bounds on paraclique density
- Distributed and sequential algorithms for bioinformatics
- Numerical experiments with LP formulations of the maximum clique problem
- The maximum clique problem
- Characteristics of the maximal independent set ZDD
- Efficient Gaussian graphical model determination under G-Wishart prior distributions
- Efficient automated pallet loading
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Hierarchical sequencing of online social graphs
- Isolation concepts for clique enumeration: comparison and computational experiments
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Exact Solution Algorithms for the Chordless Cycle Problem
- The minimal \(k\)-core problem for modeling \(k\)-assemblies
- Integer programming techniques for the nurse rostering problem
- Generating all maximal independent sets on trees in lexicographic order
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- A branch and bound algorithm for the maximum clique problem
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- Listing subgraphs by Cartesian decomposition
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks
- Parallel maximum clique algorithms with applications to network analysis
- An exact bit-parallel algorithm for the maximum clique problem
- A two-level graph partitioning problem arising in mobile wireless communications
- Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
- Large-scale clique cover of real-world networks
- A tolerance-based heuristic approach for the weighted independent set problem
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
- Multifidelity information fusion algorithms for high-dimensional systems and massive data sets
- New models and algorithms for RNA pseudoknot order assignment
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- A note on the problem of reporting maximal cliques
- A variable neighborhood search heuristic for the maximum ratio clique problem
- Computing maximal subsemigroups of a finite semigroup
- Preprocessing and cutting planes with conflict graphs
- Noise-robust modes of the retinal population code have the geometry of ``ridges and correspond to neuronal communities
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Game Theory Explorer: software for the applied game theorist
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model
- An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
- An algorithm for generating all maximal independent subsets of posets
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- Characterizing the complexity of time series networks of dynamical systems: a simplicial approach
- A branch-and-check approach for a wind turbine maintenance scheduling problem
- Indeterminate strings, prefix arrays \& undirected graphs
- Bayes linear analysis for ordinary differential equations
- LSSPER
- TABARIS
- CALMA
- QUALEX
- Cliquer
- Stony Brook
- AFGen
- OPT4J
- Gambit
- HUGIN
- BHOSLIB
- DIMACS
- MaxCliqueDyn
- CPGraph
- AllDifferent
- AtMostNValue
- ptsplib
- RAPTOR
- Cluster-C
- BBMCL
- Haploview
- gSpan
- CFinder
- Orbiter
- Algorithm 447
- Game Theory Explorer
- GamePlan
- LTR_FINDER
- Repseek
- XGame
- Varun
- CLIP
- json2run
- Havana
- R-CHIE
- BBMCSP
- biicode
- Speeding up column generation for robust wireless network planning
This page was built for software: Algorithm 457
