Algorithm 457
From MaRDI portal
Software:37543
No author found.
Related Items (only showing first 100 items - show all)
Lower bounds on paraclique density ⋮ An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 ⋮ Generating all maximal independent sets on trees in lexicographic order ⋮ A multi-KP modeling for the maximum-clique problem ⋮ Hierarchical sequencing of online social graphs ⋮ An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem ⋮ The minimal \(k\)-core problem for modeling \(k\)-assemblies ⋮ Integer programming techniques for the nurse rostering problem ⋮ Communicability graph and community structures in complex networks ⋮ Vertex packing problem application to the design of electronic testing fixtures ⋮ Accurate optimization models for interference constrained bandwidth allocation in cellular networks ⋮ Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players ⋮ Enumeration of Nash equilibria for two-player games ⋮ Border bases for lattice ideals ⋮ A computational study of conflict graphs and aggressive cut separation in integer programming ⋮ Computing maximal subsemigroups of a finite semigroup ⋮ Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ A branch-and-check approach for a wind turbine maintenance scheduling problem ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks ⋮ Infra-chromatic bound for exact maximum clique search ⋮ A new exact maximum clique algorithm for large and massive sparse graphs ⋮ Characteristics and structures of weak efficient surfaces of production possibility sets ⋮ The worst-case time complexity for generating all maximal cliques and computational experiments ⋮ A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees ⋮ What makes a \(\mathbf D_0\) graph Schur positive? ⋮ Finding optimal triangulations parameterized by edge clique cover ⋮ A rainbow clique search algorithm for BLT-sets ⋮ A novel algorithm for macromolecular epitope matching ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem ⋮ Characteristics of the maximal independent set ZDD ⋮ Clique detection for nondirected graphs: Two new algorithms ⋮ Computing maximal cliques in link streams ⋮ Refined pivot selection for maximal clique enumeration in graphs ⋮ An algorithm for generating all maximal independent subsets of posets ⋮ Fast maximal cliques enumeration in sparse graphs ⋮ Enumerating maximal cliques in link streams with durations ⋮ Efficient Gaussian graphical model determination under \(G\)-Wishart prior distributions ⋮ The journey of graph kernels through two decades ⋮ A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically ⋮ A social communication model based on simplicial complexes ⋮ Local community detection in complex networks based on maximum cliques extension ⋮ An exact algorithm for the maximum clique problem ⋮ Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience ⋮ Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets ⋮ Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs ⋮ Exact algorithms for maximum clique: a computational study ⋮ Heuristics for finding \(k\)-clubs in an undirected graph ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ \textsc{Rime}: repeat identification ⋮ Off-line mapping of multi-rate dependent task sets to many-core platforms ⋮ A new decomposition technique for maximal clique enumeration for sparse graphs ⋮ Maximal strongly connected cliques in directed graphs: algorithms and bounds ⋮ K-plex cover pooling for graph neural networks ⋮ A two-level graph partitioning problem arising in mobile wireless communications ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ Bayes linear analysis for ordinary differential equations ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling ⋮ A column generation based algorithm for the robust graph coloring problem ⋮ A note on the problem of reporting maximal cliques ⋮ Speeding up branch and bound algorithms for solving the maximum clique problem ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph ⋮ A parallel maximum clique algorithm for large and massive sparse graphs ⋮ Finding quasi core with simulated stacked neural networks ⋮ Distributed and sequential algorithms for bioinformatics ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models ⋮ A note on bimatrix game maximal Selten subsets ⋮ Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ A versatile system for computer-controlled assembly ⋮ An algorithm for obtaining the chromatic number and an optimal coloring of a graph ⋮ Theoretical underpinnings for maximal clique enumeration on perturbed graphs ⋮ An exact bit-parallel algorithm for the maximum clique problem ⋮ New models and algorithms for RNA pseudoknot order assignment ⋮ A branch-and-cut algorithm for the pallet loading problem ⋮ Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks ⋮ Preprocessing and cutting planes with conflict graphs ⋮ Subgraph isomorphism, matching relational structures and maximal cliques ⋮ An improved upper bound on maximal clique listing via rectangular fast matrix multiplication ⋮ Interesting pattern mining in multi-relational data ⋮ Speeding up column generation for robust wireless network planning ⋮ On identifying dominant cliques. ⋮ TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph ⋮ An algorithm for finding a maximum clique in a graph ⋮ Integral point sets over \(\mathbb Z_n^m\) ⋮ An exact algorithm for the pallet loading problem ⋮ Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model ⋮ Facets for node packing ⋮ Efficient automated pallet loading ⋮ Isolation concepts for clique enumeration: comparison and computational experiments ⋮ Finding weighted \(k\)-truss communities in large networks ⋮ A new backtracking algorithm for generating the family of maximal independent sets of a graph ⋮ Enumerating all connected maximal common subgraphs in two graphs ⋮ Numerical experiments with LP formulations of the maximum clique problem ⋮ An exact algorithm for the maximum \(k\)-club problem in an undirected graph ⋮ Finding maximum cliques in arbitrary and in special graphs ⋮ The maximum clique problem
This page was built for software: Algorithm 457
