Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 7 years ago.
Improve this question
Can someone explain to me the definition of a Restricted Hamiltonian Cycle?
I know what a Hamiltonian Path (and a Hamiltonian Cycle) is, but I'm having a problem understanding a what is a Restricted Hamiltonian Cycle exactly.
Thank you.
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 4 years ago.
Improve this question
So, I have an assignment that I have to represent both adjacent and incidence matrixes statically and then, use a greedy algorithm to find the shortest path (I guess that it can be lowest cost as well, not sure) that goes through all vertices having 1 as origin.
Here's an image of the graph:
I'm kinda lost on how to do it, could somebody please give me some tips?
Greedy Algorithm:
While (Not at node 1)
{
if already visited current node, fail.
look at all current node's exit costs and choose the lowest as next destination.
go to next location.
}
success.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 years ago.
Improve this question
in directed graph, each edge has a color C(e)ϵ{1,2,…k}
Found an algorithm that returns all nodes that are on circle traversal
Containing at least one edge of each color.
i think it related to SCC algorithm, but i didnt know how to start
any ideas that can help me?
Perform DFS to find cycles, and check each cycle found to see if it contains edges of all the colors.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 8 years ago.
Improve this question
What is the best algorithm to find the MST in a new graph G'(E,V,w'), where we increase the weight of one edge in graph G (the edge can or can't be in the original MST).
I read that it is possible to do it in sqrt(E), but i didn't find the algorithm.
Thanks...
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Closed 9 years ago.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Questions asking for code must demonstrate a minimal understanding of the problem being solved. Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist
Improve this question
In a directed graph, what the algorithm can find out all cycles that contain a specific vertex v?
Tarjan's algorithm for strongly connected components will give you the SCC, to which that specific vertex belongs. Now you can run a backtracking algorithm on the SCC to find all the simple cycles, which start and end on v.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
I was trying to solve a basic clique problem but i have stucked at some following points:
what is is the minimum size of the largest clique in any graph with N nodes and M edges
To Find the largest clique in a graph
Please tell me difference between above two statement.
The first is a question about the set of all graphs with N nodes and M edges. The second question appears to be about a particular graph (although it seems to be out of context).
It might be better to ask this on https://math.stackexchange.com/