Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 9022
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
3
votes
Interesting and accessible topics in graph theory
This is probably not what you're looking for, but if I were teaching such a course I'd focus on the interplay between algorithms for various graph problems and the more traditional mathematical approa …
2
votes
Greedy approach to 0-1 Knapsack problem in specific instances
As Frederico has already shown, this isn't enough to make the greedy heuristic immune to counterexamples.
It's worth mentioning that there is a simple dynamic programming algorithm for the knapsack …
- 3,934