A New Algorithm for Generating All the Maximal Independent Sets
From MaRDI portal
Publication:4138754
Cited in
(only showing first 100 items - show all)- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Coloring \((4K_1,C_4,C_6)\)-free graphs
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- On some graph classes related to perfect graphs: a survey
- A parallel algorithm to generate all maximal independent sets on permutation graphs
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
- Generating all maximal independent sets on trees in lexicographic order
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
- An inequality for polymatroid functions and its applications.
- Stability in \(P_5\)- and banner-free graphs
- Maximal independent sets in clique-free graphs
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Approximation and kernelization for chordal vertex deletion
- Privacy-preserving data splitting: a combinatorial approach
- Generate all maximal independent sets in permutation graphs
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Coloring permutation graphs in parallel
- scientific article; zbMATH DE number 2230210 (Why is no real title available?)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- On the thinness and proper thinness of a graph
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- Efficient enumeration of maximal induced bicliques
- From matchings to independent sets
- Connected vertex cover for \((sP_1+P_5)\)-free graphs
- In search of the densest subgraph
- A stratificational overlapping cluster scheme
- Recognizing max-flow min-cut path matrices
- Struction revisited
- An algorithm for generating all maximal independent subsets of posets
- On cycle transversals and their connected variants in the absence of a small linear forest
- Triangulated neighborhoods in even-hole-free graphs
- Genetic algorithmic approach to find the maximum weight independent set of a graph
- A polynomial Turing-kernel for weighted independent set in bull-free graphs
- Exact algorithms for minimum weighted dominating induced matching
- Squares of Intersection Graphs and Induced Matchings
- Generating toric noncommutative crepant resolutions
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- Matroid representation of clique complexes
- Average polynomial time complexity of some NP-complete problems
- New results on independent sets in extensions of \(2K_2\)-free graphs
- ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
- Simple games versus weighted voting games: bounding the critical threshold value
- Clique covering and clique partition in generalizations of line graphs
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
- The k-Dense Method to Extract Communities from Complex Networks
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs
- New applications of clique separator decomposition for the maximum weight stable set problem
- An exact algorithm for the pallet loading problem
- Maximum regular induced subgraphs in \(2P_3\)-free graphs
- The complexity of dissociation set problems in graphs
- Consensus algorithms for the generation of all maximal bicliques
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- A superclass of edge-path-tree graphs with few cliques
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation
- On the average-case complexity of parameterized clique
- Generating dual-bounded hypergraphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- A note on the problem of reporting maximal cliques
- A new decomposition technique for maximal clique enumeration for sparse graphs
- A sufficient condition to extend polynomial results for the maximum independent set problem
- Colouring vertices of triangle-free graphs
- Generating bicliques of a graph in lexicographic order
- Complexity of finding graph roots with girth conditions
- Graphs of separability at most two: structural characterizations and their consequences
- Feedback vertex sets in tournaments
- Computational aspects of monotone dualization: a brief survey
- Independent domination in hereditary classes
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Graphs of separability at most 2
- Mod/Resc parsimony inference: theory and application
- Graph theoretical structures in logic programs and default theories
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
- Trimmed Moebius inversion and graphs of bounded degree
- The generalized linear complementarity problem and an algorithm to find all its solutions
- Exact algorithms for exact satisfiability and number of perfect matchings
- On the stable set problem in special \(P_{5}\)-free graphs
- Enumerating maximal independent sets with applications to graph colouring.
- Intersection graphs of paths in a tree
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Hypergraph imaging: An overview
- 4-coloring \(H\)-free graphs when \(H\) is small
- On generating all maximal independent sets
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Approximately Counting Locally-Optimal Structures
- The Maximum Independent Set Problem in Planar Graphs
- Boundary classes of graphs for the dominating set problem
- Disconnecting graphs by removing vertices: a polyhedral approach
- Strong cliques in diamond-free graphs
- Updating the complexity status of coloring graphs without a fixed induced linear forest
- On the parameterized complexity of coloring graphs in the absence of a linear forest
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
This page was built for publication: A New Algorithm for Generating All the Maximal Independent Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138754)
