836 search results - page 7 / 168 » On the Complexity of Train Assignment Problems |
FCT
2009
Springer
15 years 4 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
ATMOS
2010
14 years 8 months ago
2010
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
IJFCS
2006
14 years 9 months ago
2006
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, ...
83
Voted
COCOA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...