Pages that link to "Item:Q4138754"

The following pages link to A New Algorithm for Generating All the Maximal Independent Sets (Q4138754):

Displayed 50 items.

• Parameterized algorithms for finding square roots (Q262249) ‎ (← links)
• jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology (Q281275) ‎ (← links)
• Approximately counting locally-optimal structures (Q295655) ‎ (← links)
• A unified approach to recognize squares of split graphs (Q313959) ‎ (← links)
• Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) ‎ (← links)
• Graphs with maximal induced matchings of the same size (Q344824) ‎ (← links)
• A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) ‎ (← links)
• Graphs of separability at most 2 (Q415268) ‎ (← links)
• Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) ‎ (← links)
• Mod/Resc parsimony inference: theory and application (Q418168) ‎ (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) ‎ (← links)
• On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) ‎ (← links)
• An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) ‎ (← links)
• Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) ‎ (← links)
• Maximal independent sets in a generalisation of caterpillar graph (Q512892) ‎ (← links)
• A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) ‎ (← links)
• Exact algorithms for minimum weighted dominating induced matching (Q521800) ‎ (← links)
• Generating bicliques of a graph in lexicographic order (Q557825) ‎ (← links)
• On the complexity of enumerating pseudo-intents (Q628340) ‎ (← links)
• Graph theoretical structures in logic programs and default theories (Q672050) ‎ (← links)
• Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) ‎ (← links)
• Enumerating maximal independent sets with applications to graph colouring. (Q703280) ‎ (← links)
• Consensus algorithms for the generation of all maximal bicliques (Q705493) ‎ (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) ‎ (← links)
• Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) ‎ (← links)
• Colouring vertices of triangle-free graphs without forests (Q764907) ‎ (← links)
• Maximal independent sets in caterpillar graphs (Q765369) ‎ (← links)
• Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) ‎ (← links)
• A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) ‎ (← links)
• Independent domination in hereditary classes (Q818132) ‎ (← links)
• The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) ‎ (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) ‎ (← links)
• Triangulated neighborhoods in even-hole-free graphs (Q870966) ‎ (← links)
• Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154) ‎ (← links)
• Computational aspects of monotone dualization: a brief survey (Q943839) ‎ (← links)
• A note on the problem of reporting maximal cliques (Q955035) ‎ (← links)
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) ‎ (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) ‎ (← links)
• Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) ‎ (← links)
• Enumeration aspects of maximal cliques and bicliques (Q1028116) ‎ (← links)
• A superclass of edge-path-tree graphs with few cliques (Q1038105) ‎ (← links)
• A stratificational overlapping cluster scheme (Q1063980) ‎ (← links)
• Intersection graphs of paths in a tree (Q1077439) ‎ (← links)
• Average polynomial time complexity of some NP-complete problems (Q1091815) ‎ (← links)
• Recognizing max-flow min-cut path matrices (Q1103514) ‎ (← links)
• On generating all maximal independent sets (Q1108809) ‎ (← links)
• An algorithm for generating all maximal independent subsets of posets (Q1147517) ‎ (← links)
• A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909) ‎ (← links)
• Split dimension of graphs (Q1176734) ‎ (← links)
• Recognizing clique graphs of directed and rooted path graphs (Q1293208) ‎ (← links)