Zobrazeno 1 - 10
of 113
pro vyhledávání: '"Alan J. Hoffman"'
Autor:
Chai Wah Wu, Alan J. Hoffman
Publikováno v:
Linear Algebra and its Applications. 498:136-144
We use the left vanishing eigenvector to prove various well-known conditions for determining the nonsingularity of matrices via row sums. This is in contrast to the classical approach of using the right vanishing eigenvector. We show that on occasion
Publikováno v:
Discrete Optimization. 5(2):145-150
Autor:
Alan J. Hoffman
Publikováno v:
Annals of Operations Research. 149:117-120
Autor:
Don Coppersmith, Alan J. Hoffman
Publikováno v:
Linear Algebra and its Applications. 411:277-280
If B is a singular complex matrix, there is a singular C whose entries are the same magnitude as those of B, and all but two of Cs entries are real.
Autor:
Alan J. Hoffman, Brenda Dietrich
Publikováno v:
IBM Journal of Research and Development. 47:25-30
Publikováno v:
Theoretical Computer Science. 287:563-570
We reexamine the class of (0, ±1) matrices called submodular, which we introduced in (Ann. Discrete Math. 15 (1982) 189). Our key idea in this paper is to define, for each submodular matrix M, a corresponding digraph G whose nodes are the columns of
Publikováno v:
Information Processing Letters. 83:13-16
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any) and eliminates the other endpoint of this arc; the remaining vertices
Autor:
Alan J. Hoffman, Baruch Schieber
Publikováno v:
Discrete Applied Mathematics. 113:275-284
We characterize the edge versus path incidence matrix of a series-parallel graph. One characterization is algorithmic while the second is structural. The structural characterization implies that the greedy algorithm solves the max flow problem in ser
Autor:
Alan J. Hoffman
Publikováno v:
Journal of Combinatorial Theory, Series A. 93(2):371-377
Let Mm be a matching with m edges, n?2m. We prove that the smallest number of complete bipartite graphs which partition the edges of Kn+Mm is at least n?m+?2m??1.
Publikováno v:
Linear Algebra and its Applications. 265:71-92
We prove necessary and sufficient conditions for the existence of sequences and matrices with elements in given intervals and with prescribed lower and upper bounds on the element sums corresponding to the sets of an orthogonal pair of partitions. We