Journal: Discrete Applied Mathematics

Found 533 papers in total
Multicolor routing in the undirected hypercube
Multicolor routing in the undirected hypercube
2000,
An undirected routing problem is a pair ( G,R ) where G is an undirected graph and R...
A polyhedral approach to an integer multicommodity flow problem
A polyhedral approach to an integer multicommodity flow problem
2000,
In this paper we propose a branch-and-cut algorithm for the exact solution of an...
A laminarity property of the polyhedron described by a weakly posi-modular set function
A laminarity property of the polyhedron described by a weakly posi-modular set function
2000,
Recently, Nagamochi and Ibaraki have introduced a concept of posi-modular set function...
Optimal multiple message broadcasting in telephone-like communication systems
Optimal multiple message broadcasting in telephone-like communication systems
2000,
We consider the problem of broadcasting multiple messages from one processor to many...
Dynamic storage allocation with known durations
Dynamic storage allocation with known durations
2000,
This paper is concerned with a new version of on-line storage allocation in which the...
On the P4-components of graphs
On the P4-components of graphs
2000,
Two edges are called P 4 -adjacent if they belong to the same P 4 (chordless path on...
Local symmetries in the period-doubling sequence
Local symmetries in the period-doubling sequence
2000,
We consider the infinite one-sided sequence generated by the period-doubling...
Some new Z-cyclic whist tournaments
Some new Z-cyclic whist tournaments
2000,
Let p 1 , p 2 denote primes such that p 1 ≡1(mod 36), i =1,2. One result in this...
Selecting the k largest elements with parity tests
Selecting the k largest elements with parity tests
2000,
In this paper we study the problem of finding k largest elements of n distinct real...
Existence of whist tournaments with the three-person property 3PWh(v)
Existence of whist tournaments with the three-person property 3PWh(v)
2000,
A whist tournament Wh ( v ) is said to have the three-person property if any two games...
A scheme for the synchronization of variable length codes
A scheme for the synchronization of variable length codes
2000,
A synchronization scheme is necessary when variable length codes are used in the...
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
2000,
This paper describes Fortran subroutines for computing approximate solutions to the...
On the computational complexity of edge concentration
On the computational complexity of edge concentration
2000,
Suppose that G =( U,L,E ) is a bipartite graph with vertex set U ∪ L and edge set...
Naturally submodular digraphs and forbidden digraph configurations
Naturally submodular digraphs and forbidden digraph configurations
2000,
In this paper, we present several characterizations of the classes of naturally...
On the complexity of minimizing the number of late jobs in unit time open shop
On the complexity of minimizing the number of late jobs in unit time open shop
2000,
The complexity status of unit time open shop with release dates and the minimal number...
A note on ‘parallel machine scheduling with non-simultaneous machine available time’
A note on ‘parallel machine scheduling with non-simultaneous machine available time’
2000,
The purpose of this note is to point out that if there are some machines that do not...
Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
2000,
We consider the problem of scheduling outforests and inforests with non-uniform...
On some infinite series of (r,1)-designs
On some infinite series of (r,1)-designs
2000,
( r ,1)-designs are linear spaces with v points where every point lies on exactly r...
Structural aspects of ordered polymatroids
Structural aspects of ordered polymatroids
2000,
This paper generalizes some aspects of polymatroid theory to partially ordered sets....
Recognition of tractable satisfiability problems through balanced polynomial representations
Recognition of tractable satisfiability problems through balanced polynomial representations
2000,
We consider a specific class of satisfiability (SAT) problems, the conjunctions of...
Counting symmetric configurations χ3
Counting symmetric configurations χ3
2000,
In this article we give tables of configurations χ 3 for...
Reduction of symmetric configurations n3
Reduction of symmetric configurations n3
2000,
Symmetric configurations n 3 are equivalent to the bicubic graphs of girth ≥ 6....
Two results on the bit extraction problem
Two results on the bit extraction problem
2000,
An ( n,s,t )-resilient function is a function f : {1,–1} n ÷ {1,–1}...
Optimal paths in network games with p players
Optimal paths in network games with p players
2000,
The problem of finding the optimal paths in network games with p players, which...
Papers per page: