A New Algorithm for Generating All the Maximal Independent Sets
From MaRDI portal
Publication:4138754
Cited in
(only showing first 100 items - show all)- Enumeration aspects of maximal cliques and bicliques
- A superclass of edge-path-tree graphs with few cliques
- A stratificational overlapping cluster scheme
- Intersection graphs of paths in a tree
- Average polynomial time complexity of some NP-complete problems
- Recognizing max-flow min-cut path matrices
- On generating all maximal independent sets
- An algorithm for generating all maximal independent subsets of posets
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
- Split dimension of graphs
- Recognizing clique graphs of directed and rooted path graphs
- The maximum clique problem
- Generating all maximal independent sets on trees in lexicographic order
- Clique covering and clique partition in generalizations of line graphs
- On enumerating all minimal solutions of feedback problems
- Independent domination in finitely defined classes of graphs
- An inequality for polymatroid functions and its applications.
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Struction revisited
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- A polyhedral approach to sequence alignment problems
- Coloring permutation graphs in parallel
- Efficiently enumerating all maximal cliques with bit-parallelism
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Co-bipartite neighborhood edge elimination orderings
- Maximum weight independent set for claw-free graphs in polynomial time
- Coloring square-free Berge graphs
- A new decomposition technique for maximal clique enumeration for sparse graphs
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- The generalized linear complementarity problem and an algorithm to find all its solutions
- An exact algorithm for the pallet loading problem
- On the stable set problem in special \(P_{5}\)-free graphs
- Recognizing clique graphs of directed edge path graphs
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- Boundary classes of graphs for the dominating set problem
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- Intersection graphs of Helly families of subtrees
- Generating toric noncommutative crepant resolutions
- Fast maximal cliques enumeration in sparse graphs
- Trimmed Moebius inversion and graphs of bounded degree
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Efficient enumeration of maximal induced bicliques
- Simple games versus weighted voting games: bounding the critical threshold value
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- In search of the densest subgraph
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Translating between the representations of a ranked convex geometry
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Privacy-preserving data splitting: a combinatorial approach
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- New results on independent sets in extensions of \(2K_2\)-free graphs
- Decision-based scenario clustering for decision-making under uncertainty
- On some graph classes related to perfect graphs: a survey
- Generating clause sequences of a CNF formula
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Recognizing Helly edge-path-tree graphs and their clique graphs
- The complexity of dissociation set problems in graphs
- A new approximate cluster deletion algorithm for diamond-free graphs
- Efficient parallel algorithms for parameterized problems
- On the average-case complexity of parameterized clique
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Tightening a copositive relaxation for standard quadratic optimization problems
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Matroid representation of clique complexes
- From matchings to independent sets
- On the thinness and proper thinness of a graph
- Complexity of finding graph roots with girth conditions
- Characterization of classical graph classes by weighted clique graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Genetic algorithmic approach to find the maximum weight independent set of a graph
- The k-edge intersection graphs of paths in a tree
- On hereditary clique-Helly self-clique graphs
- On balanced graphs
- Parameterized algorithms for finding square roots
- Map graphs having witnesses of large girth
- Monopolar graphs: complexity of computing classical graph parameters
- Unique key Horn functions
- Constant amortized time enumeration of Eulerian trails
- Maximal independent sets in clique-free graphs
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
- Reconfiguration of cliques in a graph
- jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology
- Parameterized complexity of the maximum independent set problem and the speed of hereditary properties
- 4-coloring \(H\)-free graphs when \(H\) is small
- Path Problems in Complex Networks
- Clique-perfectness and balancedness of some graph classes
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)
