A New Algorithm for Generating All the Maximal Independent Sets
From MaRDI portal
Publication:4138754
Cited in
(only showing first 100 items - show all)- Generating toric noncommutative crepant resolutions
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- 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
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Efficient parallel algorithms for parameterized problems
- On maximal cliques with connectivity constraints in directed graphs
- Average polynomial time complexity of some NP-complete problems
- Simple games versus weighted voting games: bounding the critical threshold value
- scientific article; zbMATH DE number 7765420 (Why is no real title available?)
- Maximal independent sets in grid graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Nonparametric estimation of the bivariate CDF for arbitrarily censored data
- Parameterized algorithms for finding square roots
- Coloring square-free Berge graphs
- Maximum dissociation sets in subcubic trees
- Generating clause sequences of a CNF formula
- Recognizing clique graphs of directed edge path graphs
- Connected vertex cover for \((sP_1+P_5)\)-free graphs
- On cycle transversals and their connected variants in the absence of a small linear forest
- Colouring vertices of triangle-free graphs without forests
- The maximum clique problem
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Graphs without large apples and the maximum weight independent set problem
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Disconnecting graphs by removing vertices: a polyhedral approach
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
- Coloring permutation graphs in parallel
- A parallel algorithm to generate all maximal independent sets on permutation graphs
- Recognizing max-flow min-cut path matrices
- Characterization of classical graph classes by weighted clique graphs
- Maximum regular induced subgraphs in 2P₃-free graphs
- The Maximum Independent Set Problem in Planar Graphs
- Graphs of separability at most 2
- Mod/Resc parsimony inference: theory and application
- Exact algorithms for exact satisfiability and number of perfect matchings
- On the average-case complexity of parameterized clique
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time
- Updating the complexity status of coloring graphs without a fixed induced linear forest
- Counting and enumerating independent sets with applications to combinatorial optimization problems
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Finding cliques in social networks: a new distribution-free model
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Generating all maximal independent sets on trees in lexicographic order
- Strong cliques in diamond-free graphs
- A superclass of edge-path-tree graphs with few cliques
- Intersection graphs of paths in a tree
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Struction revisited
- Approximation and kernelization for chordal vertex deletion
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- The complexity of dissociation set problems in graphs
- Split dimension of graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Triangulated neighborhoods in even-hole-free graphs
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Fuzzy graphs and networks repairs
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
- Enumerating maximal independent sets with applications to graph colouring.
- The k-Dense Method to Extract Communities from Complex Networks
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Approximately counting locally-optimal structures
- Generating bicliques of a graph in lexicographic order
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs
- Map graphs having witnesses of large girth
- Generate all maximal independent sets in permutation graphs
- Consensus algorithms for the generation of all maximal bicliques
- A note on the problem of reporting maximal cliques
- New results on independent sets in extensions of \(2K_2\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- Complexity and polynomially solvable special cases of QUBO
- In search of the densest subgraph
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- From matchings to independent sets
- scientific article; zbMATH DE number 2230210 (Why is no real title available?)
- Boundary classes of graphs for the dominating set problem
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- Clique covering and clique partition in generalizations of line graphs
- Matroid representation of clique complexes
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- A unified approach to recognize squares of split graphs
- Output-size sensitiveness of OBDD construction through maximal independent set problem
- An algorithm for generating all maximal independent subsets of posets
- scientific article; zbMATH DE number 7746253 (Why is no real title available?)
- On the thinness and proper thinness of a graph
- New applications of clique separator decomposition for the maximum weight stable set problem
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- An inequality for polymatroid functions and its applications.
- On some graph classes related to perfect graphs: a survey
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)
