Pages that link to "Item:Q5172740"

The following pages link to Finding, minimizing, and counting weighted subgraphs (Q5172740):

Displaying 24 items.

• 3SUM, 3XOR, triangles (Q261365) (← links)
• Evaluation of permanents in rings and semirings (Q407582) (← links)
• Faster algorithms for finding and counting subgraphs (Q439930) (← links)
• The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)
• A large subgraph of the minimum weight triangulation (Q1380821) (← links)
• Are unique subgraphs not easier to find? (Q1707980) (← links)
• Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
• Extreme witnesses and their applications (Q1799232) (← links)
• Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms (Q2019686) (← links)
• Finding the \(N\) best vertices in an infinite weighted hypergraph (Q2358678) (← links)
• Knapsack problem with objective value gaps (Q2361124) (← links)
• Fast monotone summation over disjoint sets (Q2446070) (← links)
• Mining weighted subgraphs in a single large graph (Q2660705) (← links)
• Unique subgraphs are not easier to find (Q2855752) (← links)
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics (Q3183462) (← links)
• Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
• Simple paths with exact and forbidden lengths (Q4562938) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• On Multidimensional and Monotone k-SUM (Q5111265) (← links)
• Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
• Detecting and Counting Small Pattern Graphs (Q5502097) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Counting Subgraphs in Degenerate Graphs (Q5889797) (← links)
• LATIN 2004: Theoretical Informatics (Q5901641) (← links)