On cliques in graphs
From MaRDI portal
Publication:5920767
DOI10.1007/BF02760024zbMath0144.23205OpenAlexW2013568176WikidataQ55872310 ScholiaQ55872310MaRDI QIDQ5920767
Publication date: 1965
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02760024
Related Items
An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720, Counting dominating sets and related structures in graphs, Enumerating minimal connected dominating sets in graphs of bounded chordality, Minimum cost edge blocker clique problem, jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology, The minimal \(k\)-core problem for modeling \(k\)-assemblies, On the number of connected sets in bounded degree graphs, The maximal number of induced complete bipartite graphs, A bijection between cliques in graphs and factorizations in free monoids, Exact algorithms for the minimum cost vertex blocker clique problem, Another extremal problem for Turan graphs, Blocker size via matching minors, A sharp bound on the number of maximal sum-free sets, Computing maximal subsemigroups of a finite semigroup, On rejected arguments and implicit conflicts: the hidden power of argumentation semantics, The number of maximal independent sets in a connected graph, Efficiently enumerating all maximal cliques with bit-parallelism, The worst-case time complexity for generating all maximal cliques and computational experiments, Minimal dominating sets in interval graphs and trees, Isometric embeddings in Hamming graphs, Maximal independent sets in graphs with at most one cycle, Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function, On planar Toeplitz graphs, Efficient domination of the orientations of a graph, On comparing algorithms for the maximum clique problem, Homothetic polygons and beyond: maximal cliques in intersection graphs, Trees with maximum number of maximal matchings, Problems on cycles and colorings, Enumeration and maximum number of minimal connected vertex covers in graphs, Maximal independent sets in the covering graph of the cube, Minimal dominating sets in graph classes: combinatorial bounds and enumeration, New parameterized algorithms for the edge dominating set problem, Extremal problems related to Betti numbers of flag complexes, Extremal edge polytopes, Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets, Clique detection for nondirected graphs: Two new algorithms, Inductive synthesis of cover-grammars with the help of ant colony optimization, Finding kernels or solving SAT, Refined pivot selection for maximal clique enumeration in graphs, On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s, Complement reducible graphs, Ultrametricity indices for the Euclidean and Boolean hypercubes, Combinatorial algorithms for the maximum \(k\)-plex problem, Branch and recharge: exact algorithms for generalized domination, A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically, Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets, Almost all digraphs have a kernel, Clique problem, cutting plane proofs and communication complexity, Yet harder knapsack problems, On the number of minimal dominating sets on some graph classes, A refined exact algorithm for edge dominating set, The maximum number of maximal independent sets in unicyclic connected graphs, On the number of minimal transversals in 3-uniform hypergraphs, The chromatic uniqueness of complete bipartite graphs, Indeterminate strings, prefix arrays \& undirected graphs, Hypergraph containers, A new decomposition technique for maximal clique enumeration for sparse graphs, On detecting maximal quasi antagonistic communities in signed graphs, Independent sets in graphs, A two-level graph partitioning problem arising in mobile wireless communications, Enumerating solution-free sets in the integers, A note on the problem of reporting maximal cliques, Complexity of Grundy coloring and its variants, Dominant-set clustering: a review, Exact algorithms for exact satisfiability and number of perfect matchings, On the minimum feedback vertex set problem: Exact and enumeration algorithms, On the maximum number of maximum independent sets, Bounding the feedback vertex number of digraphs in terms of vertex degrees, Enumerating maximal independent sets with applications to graph colouring., Theoretical underpinnings for maximal clique enumeration on perturbed graphs, Optimal simulation of self-verifying automata by deterministic automata, On graphs with the third largest number of maximal independent sets, On a problem of Katona on minimal separating systems, Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs, Graph with given achromatic number, On finding all unilaterally connected components of a digraph, Some properties of irreducible coverings by cliques of complete multipartite graphs, On the third largest number of maximal independent sets of graphs, On the maximum number of cliques in a graph, Optimal state reductions of automata with partially specified behaviors, Satisfiability of mixed Horn formulas, Graphs with the second largest number of maximal independent sets, k-Blocks and Ultrablocks in Graphs, Validity of clusters formed by graph-theoretic cluster methods, Efficiency in exponential time for domination-type problems, On two techniques of combining branching and treewidth, On critical subgraphs of colour-critical graphs, The number of independent sets in unicyclic graphs with a given diameter, Enumeration aspects of maximal cliques and bicliques, Maximal independent sets in caterpillar graphs, Isolation concepts for clique enumeration: comparison and computational experiments, The number of maximal independent sets in connected triangle-free graphs, Trees with the second largest number of maximal independent sets, Counting and enumerating independent sets with applications to combinatorial optimization problems, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Enumerating all connected maximal common subgraphs in two graphs, The maximum number of cliques in dense graphs, Minimum matrix representation of closure operations, The maximum clique problem, Parameterized algorithms for finding square roots, Complexity and performance of a graph theory algorithm for cluster analysis†, Finding ultrametricity in data using topology, Graph, clique and facet of Boolean logical polytope, The number of maximal independent sets in trees with a given number of leaves, Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration, The Number of Maximal Independent Sets in a Tree, On standard quadratic programs with exact and inexact doubly nonnegative relaxations, Graphs, partitions and Fibonacci numbers, THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS, All roads lead to Rome -- new search methods for the optimal triangulation problem, Maximal and maximum dissociation sets in general and triangle-free graphs, Counting maximal antichains and independent sets, On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs, On edge transitivity of directed graphs, On maximal sum-free sets in abelian groups, Unnamed Item, Path Problems in Complex Networks, Constraints on the number of maximal independent sets in graphs, On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets, Colorings with few colors: counting, enumeration and combinatorial bounds, Unnamed Item, On solution-free sets of integers, Maximal independent sets on a grid graph, Enumeration of minimal connected dominating sets for chordal graphs, Maximum modulus of independence roots of graphs and trees, A clique-detection algorithm based on neighborhoods in graphs, New formulations and branch-and-cut procedures for the longest induced path problem, The number of maximal sum-free subsets of integers, On the Number of Connected Sets in Bounded Degree Graphs, On cliques and bicliques, The second largest number of maximal independent sets in connected graphs with at most one cycle, On bicliques and the second clique graph of suspensions, A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation, Maximal independent sets in clique-free graphs, A new certificate for copositivity, Large Induced Subgraphs via Triangulations and CMSO, Exact Algorithms for Edge Domination, Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}, Intersection graph of maximal stars, On independent sets and bicliques in graphs, Covering and packing in linear space, Exact algorithms for edge domination, Invited talks, Maximal independent sets in grid graphs, Enumerating Minimal Tropical Connected Sets, Feedback Vertex Sets in Tournaments, The irreducible vectors of a lattice: some theory and applications, On the Number ofk-Dominating Independent Sets, Trimmed Moebius inversion and graphs of bounded degree, Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications, Determining the \(L(2,1)\)-span in polynomial space, Subset feedback vertex sets in chordal graphs, Maximum number of fixed points in AND-OR-NOT networks, An exact algorithm for the minimum dominating clique problem, On graphs with polynomially solvable maximum-weight clique problem, Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms, On the tractability of \(( k , i )\)-coloring, Maximal strongly connected cliques in directed graphs: algorithms and bounds, Efficient enumeration of maximal induced bicliques, Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs, Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling, Algorithms for dominating clique problems, Badly-covered graphs, On the strong \(p\)-Helly property, On the number of 2-packings in a connected graph, Groups with few maximal sum-free sets, An algorithm for obtaining the chromatic number and an optimal coloring of a graph, Clique-detection models in computational biochemistry and genomics, Iterative compression and exact algorithms, Iterative Compression and Exact Algorithms, Enriched order polytopes and enriched Hibi rings, Components in time-varying graphs, Below All Subsets for Minimal Connected Dominating Set, Posets with maximal Möbius function, Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds, The number of maximal independent sets of \((k+1)\)-valent trees, Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search, Trees with a given number of leaves and the maximal number of maximum independent sets, Robustness: a new form of heredity motivated by dynamic networks, On the computation of fixed points in Boolean networks, Maximal independent sets and regularity of graphs, Converting Self-verifying Automata into Deterministic Automata, An improved upper bound on maximal clique listing via rectangular fast matrix multiplication, Trees without twin-leaves with smallest number of maximal independent sets, Exclusion and multiplicity for stable communities in Lotka-Volterra systems, The maximal number of induced \(r\)-partite subgraphs, Cliques of a graph-variations on the Bron-Kerbosch algorithm, On Maximal Chain Subgraphs and Covers of Bipartite Graphs, Stability for maximal independent sets, On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms, On the Number of Minimal Separators in Graphs, Self-Verifying Finite Automata and Descriptional Complexity, An \(n^ 2\) algorithm for determining the bridges of a graph, On the complexity of solution extension of optimization problems, From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces, A finiteness theorem for maximal independent sets, Worst-case analysis of clique MIPs, The number of independent sets in unicyclic graphs, On maximum number of minimal dominating sets in graphs, On maximum independent set of categorical product and ultimate categorical ratios of graphs, Proximity Search for Maximal Subgraph Enumeration, On Independent Sets and Bicliques in Graphs, Steiner's problem in graphs and its implications, Extension of some edge graph problems: standard, parameterized and approximation complexity, An algorithm for determining the automorphism partitioning of an undirected graph, On the maximum number of maximum independent sets in connected graphs, MIP formulations for induced graph optimization problems: a tutorial, Enumeration of minimal tropical connected sets, Counting maximal independent sets in some \(n\)-gonal cacti, Minimum cost flow problem with conflicts, Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems, On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza, Computing dense and sparse subgraphs of weakly closed graphs, A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements, Mobility offer allocations in corporate settings, An approximation algorithm for 3-Colourability, Stable fixed points of combinatorial threshold-linear networks, On radius 2 trees with the maximum number of matchings, Deciding 3-colourability in less than O(1.415n) steps, Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes, Finding Cliques in Social Networks: A New Distribution-Free Model, Unnamed Item, Maximum dissociation sets in subcubic trees, On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number, Tight Lower Bounds for the Complexity of Multicoloring, On the maximum number of maximum dissociation sets in trees with given dissociation number, Unnamed Item, Unnamed Item, DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS, Constructing test functions for global optimization using continuous formulations of graph problems, Open Problems in Abstract Argumentation, An upper bound for the number of maximal independent sets in a graph, Coverings, Matchings and the number of maximal independent sets of graphs, Maximal Induced Matchings in Triangle-Free Graphs, Unnamed Item, The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem, On cliques in graphs, Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation, Unnamed Item, Unnamed Item, On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm, Coalitions of arguments: A tool for handling bipolar argumentation frameworks, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem, On cliques in graphs
Cites Work
