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 algorithms
Search options not deleted
user 31310
Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.
1
vote
Is there an algorithm for generating sets of routes that satisfy edge volume constraints?
At the very lowest level of modelling, one has to make some assumptions about the chosen paths, e.g. that they are the optimal ones connecting a pair of nodes.
With that assumption, one obtains for ea …
- 13.2k
1
vote
Algorithm for Low Discrepancy Sequence of Hamilton Cycles in Complete Graphs
The first thing I did, was to repeat my search for algorithms that generate the $n$-th Steinhaus-Trotter-Johnson permutation - needless to say that the search was still not successful; this time however …
- 13.2k
3
votes
2
answers
718
views
Algorithms for Sorting Subset Sums
There should different algorithms for the case of only positive element-weights and for positive and negative element weights. …
- 13.2k
0
votes
Algorithms for Sorting Subset Sums
After some fruitless efforts to devise a tree-structure based on subset inclusion and after some investigations on the usability of de Bruijn sequences, I finally arrived at a surprisingly simple meth …
- 13.2k
3
votes
Shortest path in a weighted graph with coloured edges
The problem can be reduced to an ordinary shortest path problem via vertex splitting where however, the number of generated vertices equals the degree of the original vertex and not two, as is commonl …
- 13.2k
6
votes
1
answer
749
views
Relevance of Landau's Algorithm for Denesting Radicals
Googling "Landau's Algorithms" produces references to the Wang and Landau Algorithm. …
- 13.2k
4
votes
2
answers
137
views
Complexity of Determining the Edges of Planar Convex Hulls
Question:
can the set of edges that resemble the convex hull ($CH$ for short) of $n$ points in the euclidean plane be determined in $O(n)$ time?
I know that the time complexity of determining the $C …
- 13.2k
2
votes
2
answers
132
views
Algorithm for Finding all Empty Ellipses Locked by a Set of Points
Any information about the problem of determining the set of all locked empty ellipses for a given set of points $\mathcal{P}$ (e.g. complexity of algorithms, bounds on the number of ellipses, etc.) would …
- 13.2k
1
vote
Detecting Negative Cycles in Undirected Graphs
Unfortunately, the answer is negative in the general case!
Counterexamples can be easily constructed in the following way:
take a graph, that resembles a tree with at least one sufficiently lon …
- 13.2k
2
votes
1
answer
1k
views
Detecting Negative Cycles in Undirected Graphs
, that the problem of detecting negative cost cycles in undirected graphs (UNCCD problem) is "significantly harder than the corresponding problem in directed graphs" and the complexities of different algorithms …
- 13.2k
1
vote
0
answers
214
views
Testing Randomness of Permutation Sequences
Maybe this question is too simple, but I couldn't find anything that is concerned with measuring how random a sequence of permutations of $n$ elements( w.l.o.g. of the numbers $\lbrace 1,\ \dots,\ n \ …
- 13.2k
0
votes
0
answers
40
views
Subgraph induced by negative cycles detected by Bellman-Ford algorithm
What is known about the properties of the subgraph induced by the negative cycles are defined by the predecessor relation that is established during the execution of the Bellman-Ford algorithm and arc …
- 13.2k
1
vote
1
answer
87
views
Finding Optimal Vertex Weights without Linear Programing
Are there algorithms for finding $\omega_1\dots,\omega_n$, so that
$\omega_i+\omega_j\le \|e_{ij}\|\ \forall i,j\quad\wedge\quad\sum{\omega_i}=max$
that are not based on linear programing, e.g. graph … theoretic algorithms? …
- 13.2k
1
vote
0
answers
54
views
Limit Behavior of a Graph Iteration
,Let $G(V,E)$ be a weighted complete graph.
Let further $\min_k(v_i)$ denote, depending on whether the context is arithmetic or set theoretic, either the set of the $k$ smallest edges adjacent to $v_ …
- 13.2k
1
vote
0
answers
32
views
Algorithms for Detecting the Completion of a Triangle in a Stream of Edges
Please feel free to provide algorithms that are dedicated to special situations like distances between pairs of points in the Euclidean plane. …
- 13.2k