In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded treewidth. Each of these problems has as a characteristic a uniform upper bound on the tree ...

In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Trian-gulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded pathwidth. Each of these problems has as a characteristic a uniform upper bound on the tree...

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...

A new approach to model multi-agent systems with hierarchical colored Petri nets is introduced. Every agent has its colored Petri net system, when agents are composed into a MAS, we get hierarchical colored Petri net system of the multi-agent system, properties of the hierarchical colored Petri net system, such as reachability, deadlock detection and avoidance, fairness can be used to analyze d...

The goal of this paper is to prove new recurrences involving 2–colored and 3–colored generalized Frobenius partitions of n similar to the classical recurrence for the partition function p(n). Section