( en | de | ru )

 

Disambiguation of "Brimkov, Boris"

Author of the publication

copydeleteadd this publication to your clipboard
The zero forcing polynomial of a graph

, , , , , , , and . (2018)cite arxiv:1801.08910Comment: 23 pages.
DOI: 10.1016/j.dam.2018.11.033

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bettina Borisch

Svetlana Borisova

Nuchim Borissowsky

Klaus Borisch

Dimitriya Borisova

 

Other publications of authors with the same name

An exact algorithm for the minimum rank of a graph, and . (2019)cite arxiv:1912.00158Comment: 12 pages.Improved Computational Approaches and Heuristics for Zero Forcing., , and . INFORMS J. Comput., 33 (4): 1384-1399 (2021)On Connectedness of Discretized Sets., and . IWCIA, volume 12148 of Lecture Notes in Computer Science, page 20-28. Springer, (2020)A note on the clique number of complete k-partite graphs.. CoRR, (2015)The zero forcing polynomial of a graph, , , , , , , and . (2018)cite arxiv:1801.08910Comment: 23 pages.Complexity and Computation of Connected Zero Forcing.. CoRR, (2016)Minimal Zero Forcing Sets, and . (2022)cite arxiv:2204.01810Comment: 13 pages, 3 figures.On the status sequences of trees., , and . Theor. Comput. Sci., (2021)Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD., , and . DGCI, volume 5810 of Lecture Notes in Computer Science, page 337-349. Springer, (2009)On Sets of Line Segments Featuring a Cactus Structure.. IWCIA, volume 10256 of Lecture Notes in Computer Science, page 30-39. Springer, (2017)