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/
Related
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 2 years ago.
Improve this question
can anyone give me an example of this algorithm? Can it be longest common increasing subsequence?
It seems to be a minimum path length to reach v from s(starting point) where E is the set of edges from vertex u to vertex v.
Looks like an algorithm to find the shortest path in a graph.
d(v) is shortest path from vertex s to v moving along edges where the cost of an edge from u to v is c(u,v).
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 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
Say you were given a black box that solves a clique problem in constant time.
You give the black box an undirected graph G with a bound k and it outputs either "Yes" or "No" that the graph G has a clique with at least k vertices.
How would you use this black box to find the vertices of a maximum clique in polynomial time?
As a hint, think about what happens if you choose a node from the graph, delete it, and then check whether there's still a k-clique. The black box will either say that there is or that there isn't. What do you learn if there still is a k-clique? What do you learn if there isn't?
Hope this helps!