Modelling the Eulerian Path Problem using a String Matching Framework
| dc.creator | Trinca, Dragos | |
| dc.date | 2005-08-21 | |
| dc.date.accessioned | 2026-07-07T03:23:21Z | |
| dc.date.available | 2026-07-07T03:23:21Z | |
| dc.description | 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}). | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0508087 | |
| dc.identifier | http://arxiv.org/abs/cs/0508087 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32908 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | E.1; F.2.2; G.2.2 | |
| dc.title | Modelling the Eulerian Path Problem using a String Matching Framework | |
| dc.type | text |