Journal: Discrete Applied Mathematics

Found 533 papers in total
Some aspects of the semi-perfect elimination
Some aspects of the semi-perfect elimination
1991,
Several efficient algorithms have been proposed to construct a perfect elimination...
Approximation algorithms for hitting objects with straight lines
Approximation algorithms for hitting objects with straight lines
1991,
In the hitting set problem one is given m subsets of a finite set N and one has to...
A convoy scheduling problem
A convoy scheduling problem
1991,
A mixed-integer programming formulation is given for the problem of scheduling the...
The basic cyclic scheduling problem with deadlines
The basic cyclic scheduling problem with deadlines
1991,
The purpose of this paper is to study the latest schedule existence, calculation and...
A generalization of the zero-one principle for sorting algorithms
A generalization of the zero-one principle for sorting algorithms
1991,
In this paper a new general approach for the so-called ‘zero-one...
Parallel machines scheduling with nonsimultaneous machine available time
Parallel machines scheduling with nonsimultaneous machine available time
1991,
The paper considers the problem of scheduling n independent jobs on m identical...
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
1991,
Given the minimum Hamiltonian path (or traveling salesman tour) H 0 in an undirected...
The threshold order of a Boolean function
The threshold order of a Boolean function
1991,
The notion of a threshold function as a Boolean function for which there is a...
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
1991,
Recently, Apostol studied the number of binary vectors in n- space containing exactly...
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
1991,
Two algorithms have been described in the literature for determining the sophisticated...
A difficulty in particular Shannon-like games
A difficulty in particular Shannon-like games
1991,
There is a simple theory of strategy for generalized Shannon switching games (on...
A deletion game on hypergraphs
A deletion game on hypergraphs
1991,
Two players alternately select either a vertex or an edge of a hypergraph H, deleting...
NP-completeness of edge-colouring some restricted graphs
NP-completeness of edge-colouring some restricted graphs
1991,
The problem of determining the chromatic index of a regular graph of fixed degree...
On an edge ranking problem of trees and graphs
On an edge ranking problem of trees and graphs
1991,
A k-edge ranking of an undirected graph is a labeling of the edges of the graph with...
When each hexagon of a hexagonal system covers it
When each hexagon of a hexagonal system covers it
1991,
In this paper the authors establish a simple criterion which enables them to determine...
A note on isomorphic simulation of automata by networks of two-state automata
A note on isomorphic simulation of automata by networks of two-state automata
1991,
Let 𝒟 be a class of digraphs. Supposing that the strongly connected subgraphs of...
The relationship between the threshold dimension of split graphs and various dimensional parameters
The relationship between the threshold dimension of split graphs and various dimensional parameters
1991,
Let the coboxicity of a graph G be denoted by cob( G), and the threshold dimension by...
On the use of augmenting chains in chain packings
On the use of augmenting chains in chain packings
1991,
In a graph G=(X,E), we assign to each node ν a positive integer b(ν)•d G...
Lopsided Lovász Local lemma and Latin transversals
Lopsided Lovász Local lemma and Latin transversals
1991,
A new version of the Lovász Local lemma is used to prove the existence of Latin...
Holes in random graphs
Holes in random graphs
1991,
It is shown that for every •>0 with the probability tending to 1 as...
Lattice bandwidth of random graphs
Lattice bandwidth of random graphs
1991,
The bandwidth of a random graph has been well studied. A natural generalization of...
Some recent results on niche graphs
Some recent results on niche graphs
1991,
In an earlier paper entitled ‘Niche graphs’ written by Cable, Jones,...
Connectivity of generalized prisms over G.
Connectivity of generalized prisms over G.
1991,
The problem of building larger graphs with a given graph as an induced subgraph is one...
Threshold spectra via the Ehrenfeucht game
Threshold spectra via the Ehrenfeucht game
1991,
Employing an analysis of the Ehrenfeucht game a partial characterization of the...
Papers per page: