Journal: Discrete Applied Mathematics

Found 533 papers in total
Matchings and cycle covers in random digraphs
Matchings and cycle covers in random digraphs
1991,
Consider a random bipartite graph in which each of n white vertices is adjacent to...
On a unique tree representation for P4-extendible graphs
On a unique tree representation for P4-extendible graphs
1991,
Several practical applications in computer science and computational linguistics...
Two metrics in a graph theory modeling of organic chemistry
Two metrics in a graph theory modeling of organic chemistry
1992,
Two different metrics in the graph theory model of organic chemistry are defined. The...
Polynomial graph-colorings
Polynomial graph-colorings
1992,
For directed graphs G and H , the authors say that G is H -colorable, if there is a...
A tree representation for P4-sparse graphs
A tree representation for P4-sparse graphs
1992,
A graph G is P 4 -sparse if no set of five vertices in G induces more than one...
Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
1991,
This paper presents an algorithm for finding a simplest n- dimensional linear feedback...
The parameters of subcodes of algebraic-geometric codes over prime subfields
The parameters of subcodes of algebraic-geometric codes over prime subfields
1991,
This paper proposes a uniform approach to BCH codes, Goppa codes, and subfield...
The covering radius of doubled 2-designs in 2Ok
The covering radius of doubled 2-designs in 2Ok
1991,
The following problem originated from interconnection network considerations: what is...
Distances in cocomparability graphs and their powers
Distances in cocomparability graphs and their powers
1992,
Let denote the class of cocomparability graphs. The paper characterizes by a distance...
Self-dual codes and Hadamard matrics
Self-dual codes and Hadamard matrics
1991,
A general method unifying known constructions of binary self-orthogonal codes from...
Algebraic-geometric codes and asymptotic problems
Algebraic-geometric codes and asymptotic problems
1991,
This is an attempt to analyze the present state of affairs concerning asymptotic...
Block coded modulation and concatenated coding schemes for error control on fading channels
Block coded modulation and concatenated coding schemes for error control on fading channels
1991,
Block coded modulation (BCM) for digital communication over fading channels is...
Legendre sums and codes related to QR codes
Legendre sums and codes related to QR codes
1992,
Circulant codes related to QR codes are studied. An expression for the weight of a...
An O(n2) algorithm for the maximum cycle mean of an bivalent matrix
An O(n2) algorithm for the maximum cycle mean of an bivalent matrix
1992,
For a general real matrix , standard algorithms exist to find its maximum cycle mean,...
An εà-approximation scheme for combinatorial optimization problems with minimum variance criterion
An εà-approximation scheme for combinatorial optimization problems with minimum variance criterion
1992,
Suppose that a finite set E , a family of feasible subsets of E and a real cost...
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
1992,
Suppose that a finite set E , a family of feasible subsets of E and a nonnegative cost...
Efficient polynomial algorithms for distributive lattices
Efficient polynomial algorithms for distributive lattices
1991,
Use is made of an original property of breadth-first search in the Hasse graph of a...
Classes of bipartite graphs related to chordal graphs
Classes of bipartite graphs related to chordal graphs
1991,
This paper examines in a systematical way connections between chordal, strongly...
Efficiently solvable special case of bottleneck travelling salesman problems
Efficiently solvable special case of bottleneck travelling salesman problems
1991,
The paper investigates bottleneck travelling salesman problems (BTSP) which can be...
Classification of normalized cluster methods in an order theoretic model
Classification of normalized cluster methods in an order theoretic model
1991,
An interesting class of cluster methods in the Janowitz model for cluster analysis is...
A new method for solving algebraic systems of positive dimension
A new method for solving algebraic systems of positive dimension
1991,
A new algorithm is presented for solving algebraic systems of equations, which is...
Representation of bicircular matroids
Representation of bicircular matroids
1991,
A bicircular matroid is a matroid defined on the edge set of a graph. Two different...
(i,j) Competition graphs
(i,j) Competition graphs
1991,
If D is an acyclic digraph, its competition graph has the same vertex set as D and an...
Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
1991,
In this paper the authors define the concept of g -sextet rotation graph of a...
Papers per page: