Given a DAG with |V| = n and has s sources we have to present subgraphs such that each subgraph has approximately k1=√|s| sources and approximately k2=√|n| nodes.
Given a weighted graph (directed or undirected) I need to find the cycle of the graph with the maximum weight.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcann开发者_如何转开发ot be reasonably answered in its current for
These questions regard a set of data with lists of tasks performed in succession and the total time required to complete them. I\'ve been wondering whether it would be possible to determine useful thi
I开发者_JS百科 have a directed cyclic graph with more than one cycle in it and I need a way to detect (and list) each cycle present in the digraph.
Closed. This question is opinion-based. It is not currently accepting answers. Want to improve this question? Update the question so it can be answered with facts and citations by editing
Can some one tell me the difference between hamil开发者_开发技巧tonian path and euler path. They seem similar!An Euler path is a path that passes through every edge exactly once. If it ends at the ini
What is the most efficient way to generate a large (~ 300k vertices) random planar 开发者_JS百科graph (\"random\" here means uniformly distributed)?Have you looked at Boltzmann sampling? See the paper
I have a very, very large graph, and I want to find the shortest path from one vertex to another. The graph is directed and unweighted.
The diagram shown on this link of the \"A graph with 6 vertices and 7 edges where the vertex no 6 on the far-left is a leaf vertex or a pendant vertex.\" has DIAMETER 4? right or wrong?
加载中,请稍侯......