Within the last year
Within the past 3 years
1 - 9 of 9 articles
The papers deals with a bicriterion approach to preemptive scheduling of m parallel machines for jobs having processing costs which are linear functions of variable processing times. One of the objective functions is a completion time and the other, a processing cost. In the case of identical...
Suppose G = ( V , E ) is a graph in which every vertex v ϵ V is associated with a cost c ( v ). This paper studies the weighted independent perfect domination problem on G , i.e., the problem of finding a subset D of V such that every vertex in V is equal or adjacent to exactly one vertex in D...
A vertex x in a subset X of vertices of a graph is redundant if its closed neighbourhood is contained in the union of closed neighbourhoods of vertices of X − x . This paper describes the structure of bipartite graphs, chordal graphs and graphs of girth at least five in which every maximal set...
A fixed number n of jobs has to be selected from a set of possible jobs; then the chosen jobs have to be ordered for processing on a single machine which is subject to breakdown. The probability that the machine fails while working on some job J depends on J . To each job there corresponds a...
Answering an open problem in papers by Marcus and Pǎun (1994), we give here two examples of infinite (nonalmost periodic) words ω such that the set of subwords appearing infinitely many times in ω is context-free nonregular (in fact, one language is linear nonregular and one is context-free...
Algorithms for the constrained bottleneck matroid base problem and the constrained bottleneck independent set problem are presented. The algorithms have improved complexities upon the best known general algorithm. Sufficient conditions are obtained when the proposed algorithms have linear...
We consider labelings (i.e. assignments of labels to the links that give the network a globally consistent orientation) on anonymous Cayley networks N G constructed from a set G of generators of a group G . Such networks can be endowed with a natural labeling L G to form the oriented Cayley...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.