Modelling the Eulerian Path Problem using a String Matching Framework

Details Modelling the Eulerian Path Problem using a String Matching Framework Modelling the Eulerian Path Problem using a String Matching Framework

2005-08-21

arxiv.org/abs/cs/0508087v1

Computer Science

Data Structures and Algorithms

10 pages

Scientific paper

The well-known Eulerian path problem can be solved in polynomial time (more exactly, there exists a linear time algorithm for this problem). In this paper, we model the problem using a string matching framework, and then initiate an algorithmic study on a variant of this problem, called the (2,1)-STRING-MATCH problem (which is actually a generalization of the Eulerian path problem). Then, we present a polynomial-time algorithm for the (2,1)-STRING-MATCH problem, which is the most important result of this paper. Specifically, we get a lower bound of Omega(n), and an upper bound of O(n^{2}).

Affiliated with

Also associated with

No associations

Rating

Modelling the Eulerian Path Problem using a String Matching Framework does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modelling the Eulerian Path Problem using a String Matching Framework, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modelling the Eulerian Path Problem using a String Matching Framework will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33479