Paths and Trails in Edge-Colored Graphs
نویسندگان
چکیده
∗Sponsored by French Ministry of Education †Sponsored by Conselho Nacional de Desenvolvimento Cient́ıfico e Tecnológico CNPq ‡Sponsored by Conselho Nacional de Desenvolvimento Cient́ıfico e Tecnológico CNPq
منابع مشابه
On s-t paths and trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding monochromatic and properly edge-colored s-t paths/trails on edge-colored graphs. Given a c-edge-colored graph Gc without properly edge-colored closed trails, we present a polynomial time procedure for the determination of properly edgecolored s-t trails visiting all vertices of Gc a prescribed number of tim...
متن کاملOn paths, trails and closed trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding properly edge-colored (or PEC) paths, trails and closed trails. Given a c-edge-colored graph G, we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex is specified before hand. As a consequence, we solve a number of interesting related problems. For ...
متن کاملAcyclicity in edge-colored graphs
A walk W in edge-colored graph is called properly colored (PC) if every pair of consecutive edges in W is of different color. We study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i+1, i = 1, 2, 3, 4. The first three types are equivalent to the absence of PC cycles, PC trails, and PC walks. Wh...
متن کاملThe Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs
We introduce a number of problems regarding edge-color modifications in edge-colored graphs and digraphs. Consider a property π, a c-edge-colored graph G not satisfying π, and an edge-recoloring cost matrix R = [rij ]c×c where rij ≥ 0 denotes the cost of changing color i of edge e to color j. Basically, in this kind of problem the idea is to change the colors of one or more edges of G in order ...
متن کاملMonochromatic s-t Paths in Edge-Colored Graphs
In this paper we consider an approach to solve the problem of finding monochromatic s-t paths in edge-colored graphs. This approach is based on constructing logical models for the problem. Algorithmic problems extensively investigated in bioinformatics (see e.g. [1] – [3]). In particular, there are a number of applications of different problems of finding paths. In this paper we consider the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 409 شماره
صفحات -
تاریخ انتشار 2008