Pages that link to "Item:Q5091123"

The following pages link to An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123):

Displaying 9 items.

• On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
• Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• (Q5053191) (← links)
• Maximizing Social Welfare in Score-Based Social Distance Games (Q6199615) (← links)
• Exact and approximate hierarchical hub labeling (Q6575394) (← links)
• The bag-based search: a meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition (Q6606245) (← links)