Search Results

Results tagged with Search options user 80225
5 results

An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.

Try the following (inefficient) approach. Assume there are $N$ points in total. Now with each of the $N$ points try to find a line segment that passes through it with the least number of mis-classific …
answered Dec 3 '17 by csTheoryBeginner
Floyd Marshall can be used to detect the presence of negative cycles in directed graphs. This aspect has been widely used in the scheduling community in the form of detecting consistency of a simple t …
answered Mar 20 '18 by csTheoryBeginner
From @quicksort answer it should be clear that min spanning tree remains same. Just to understand why it is false for the shortest path problem, consider the following counter-example. Let a graph con …
answered Nov 30 '17 by csTheoryBeginner
This may not directly answer your question, but can help. The problem you are looking at is complement to the Betweenness (https://en.wikipedia.org/wiki/Betweenness) problem. In your problem, for the …
answered Nov 22 '17 by csTheoryBeginner
Given a graph $G(V, A)$, we know that any spanning tree contains an edge in every cutset. Let $S_{min}^{max}$ and $S$ be the minimax weight spanning tree of $G$ and minimum weight spanning tree of \$G …
answered Nov 22 '17 by csTheoryBeginner