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 ds.algorithms
Search options not deleted
user 15421
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
1
vote
#SAT Solver download
Here is one called tensorCSP and based on a tool called tensor networks. It is explained in this paper.
- 848
2
votes
1
answer
117
views
Maximum cardinality disjoint cycle cover in undirected graphs
I call a maximum cardinality disjoint cycle cover of a graph a vertex-disjoint cycle cover containing the maximum possible number of cycles in the graph. What is known about the complexity of this pro …
- 848
2
votes
Program for computing Tree decomposition of a graph
You may also be interested in the more modern algorithms FlowCutter (GitHub) and the algorithms by Tamaki et al. (GitHub)
- 848
2
votes
What is the fastest algorithm for computing exact network reliability?
This paper shows an exact mapping from reliability to exact model counting. From that point on, exact counters (like miniC2D) can be used to compute reliability. Not sure if useful runtime bounds exis …
- 848