Pages that link to "Item:Q703280"

The following pages link to Enumerating maximal independent sets with applications to graph colouring. (Q703280):

Displayed 36 items.

• Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) ‎ (← links)
• Minimal dominating sets in interval graphs and trees (Q344851) ‎ (← links)
• Regular inference as vertex coloring (Q465248) ‎ (← links)
• Independent sets in graphs (Q501998) ‎ (← links)
• Branch and recharge: exact algorithms for generalized domination (Q639293) ‎ (← links)
• Solving connected dominating set faster than \(2^n\) (Q958203) ‎ (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) ‎ (← links)
• On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) ‎ (← links)
• Computing branchwidth via efficient triangulations and blocks (Q967315) ‎ (← links)
• Approximation of min coloring by moderately exponential algorithms (Q989534) ‎ (← links)
• On two techniques of combining branching and treewidth (Q1022343) ‎ (← links)
• Fibonacci index and stability number of graphs: a polyhedral study (Q1041432) ‎ (← links)
• An algorithm for exact satisfiability analysed with the number of clauses as parameter (Q1045885) ‎ (← links)
• Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) ‎ (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) ‎ (← links)
• Algorithms for dominating clique problems (Q1758169) ‎ (← links)
• Decomposition of realizable fuzzy relations (Q1955454) ‎ (← links)
• Trimmed Moebius inversion and graphs of bounded degree (Q1959390) ‎ (← links)
• Exact algorithms for counting 3-colorings of graphs (Q2081467) ‎ (← links)
• Vertex coloring of a graph for memory constrained scenarios (Q2183733) ‎ (← links)
• Iterative compression and exact algorithms (Q2268862) ‎ (← links)
• Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) ‎ (← links)
• The parameterized complexity of maximality and minimality problems (Q2470035) ‎ (← links)
• On the computation of fixed points in Boolean networks (Q2511059) ‎ (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) ‎ (← links)
• Iterative Compression and Exact Algorithms (Q3599139) ‎ (← links)
• Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) ‎ (← links)
• Feedback Vertex Sets in Tournaments (Q4908824) ‎ (← links)
• From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) ‎ (← links)
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) ‎ (← links)
• Turán Graphs, Stability Number, and Fibonacci Index (Q5505651) ‎ (← links)
• Maximal Induced Matchings in Triangle-Free Graphs (Q5891021) ‎ (← links)
• When polynomial approximation meets exact computation (Q5892165) ‎ (← links)
• When polynomial approximation meets exact computation (Q5915964) ‎ (← links)
• Faster graph coloring in polynomial space (Q5925619) ‎ (← links)
• Exponential-time quantum algorithms for graph coloring problems (Q5970782) ‎ (← links)