Pages that link to "Item:Q2848203"

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

Displaying 30 items.

• Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)
• Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
• Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
• Quantum algorithm design: techniques and applications (Q1730317) (← links)
• Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Finding the \(N\) best vertices in an infinite weighted hypergraph (Q2358678) (← links)
• Mining weighted subgraphs in a single large graph (Q2660705) (← links)
• Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• (Q4637980) (← links)
• Counting problems in parameterized complexity (Q5009461) (← links)
• From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
• Hamming Distance Completeness (Q5088904) (← links)
• (Q5090377) (← links)
• (Q5091007) (← links)
• Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
• Counting Answers to Existential Questions (Q5091275) (← links)
• (Q5121894) (← links)
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
• LATIN 2004: Theoretical Informatics (Q5901641) (← links)
• Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
• On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
• Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
• Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
• Finding and counting small tournaments in large tournaments (Q6652454) (← links)