tags:

views:

56

answers:

0
Q: 

Finding two distinct path in a DAG with Maximum sum of vertices

I want to find the two distinct path with no shared vertices in a Directed Acyclic Graph so that sum of vertices in the two path becomes maximum. I have an O(n^3) answer for it which is pretty obvious, I need a better way.

Thanks in advance

related questions

Tree (directed acyclic graph) implementation
C/C++ strip chart
Command-line Unix ASCII-based charting / plotting tool
Flash Charts and Graphs exported for use in PDF reports - automation
Best graph and diagram toolset for PHP
JS library for waterfall graphs
What's a good f/oss GDI+ (System.Drawing) based graphing and charting component for .NET?
Designing a Yahoo Pipes inspired interface
Prim's Algorithm, Priority First Search and Minimum Spanning Trees (MST)
What is your favourite 3rd party WinForms.Net graphing tool, and why?
Drawing a Web Graph
How do I create graphs in Perl on Windows?
Graph Algorithm To Find All Connections Between Two Arbitrary Vertices
C# graph traversal - tracking path between any two nodes
Graph searching algorithm
How to serialize a graph structure?
Graph (Chart) Algorithm
Do you know any graph visualization libraries for .NET?
How do I calculate a trendline for a graph?
Is there a Box Plot graph avalible for Reporting Services 2005?
Graphing JavaScript Library
graph serialization
What problems can be solved, or tackled more easily, using graphs and trees?
What are the best solutions for flash charts and graphs?
What is the most efficient graph data structure in Python?