Pages that link to "Item:Q5434422"

The following pages link to Algorithms for Counting 2-Sat Solutions and Colorings with Applications (Q5434422):

Displaying 12 items.

• On two techniques of combining branching and treewidth (Q1022343) (← links)
• A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
• Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
• Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
• Fast algorithms for max independent set (Q2428670) (← links)
• On independent sets and bicliques in graphs (Q2428684) (← links)
• Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
• Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
• Rényi entropies as a measure of the complexity of counting problems (Q3301573) (← links)
• A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
• Faster graph coloring in polynomial space (Q5925619) (← links)
• Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)