Computational and theoretical challenges for computing the minimum rank of a graph
Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson, Logan Smith
| Year of publication: |
2022
|
|---|---|
| Authors: | Hicks, Illya V. ; Brimkov, Boris ; Deaett, Louis ; Haas, Ruth ; Mikesell, Derek ; Roberson, David ; Smith, Logan |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 6, p. 2868-2872
|
| Subject: | forts | matroid | maximum nullity | minimum rank | zero forcing | Ranking-Verfahren | Ranking method | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Computerunterstützung | Computerized method |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2022.1219 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10014326303