The completable digraphs for the totally nonnegative completion problem
type: Item
instance of: scholarly article
title: The completable digraphs for the totally nonnegative completion problem
zbMATH Open document ID: 1191.05053
author: Ramadán el-Ghamry
author: Cristina Jordán
author: Juan Ramón Torregrosa Sánchez
published in: Linear Algebra and its Applications
publication date: 2009-02-25T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15B48
zbMATH DE Number: 5518780
zbMATH Keywords: partial matrix
zbMATH Keywords: totally nonnegative matrix
zbMATH Keywords: completion problem
zbMATH Keywords: directed graph
MaRDI profile type: Publication
full work available at URL: j.laa.2008.07.009
OpenAlex ID: W2064042831
cites work: Totally positive matrices
cites work: Q4288578
cites work: Q3002117
cites work: Q4941601
cites work: Q4400640
cites work: The totally positive completion problem
cites work: Q5624248
cites work: Q3851094
DOI: 10.1016/J.LAA.2008.07.009
description: scientific article; zbMATH DE number 5518780