Pages that link to "Item:Q4435347"

The following pages link to Small Maximal Independent Sets and Faster Exact Graph Coloring (Q4435347):

Displaying 24 items.

• Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
• Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
• New plain-exponential time classes for graph homomorphism (Q639844) (← links)
• Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
• Graph coloring by multiagent fusion search (Q1037448) (← links)
• Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
• Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
• A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
• Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
• Facility location with tree topology and radial distance constraints (Q2280295) (← links)
• Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
• The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
• Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
• New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
• On the number of maximal bipartite subgraphs of a graph (Q4667793) (← links)
• (Q4778579) (← 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)
• Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)
• Faster graph coloring in polynomial space (Q5925619) (← links)
• On the hardness of inclusion-wise minimal separators enumeration (Q6195343) (← links)
• Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring (Q6579767) (← links)
• Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)