scientific article; zbMATH DE number 7300406

MaRDI QIDQ5146181FDO

Authors M. B. Abrosimov

Publication date 25 January 2021

Full work available at URL http://mathnet.ru/eng/pdm105

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 913340 (Why is no real title available?)
• A Graph Model for Fault-Tolerant Computing Systems
• Edge fault tolerance in graphs

Cited in

(5)

• Estimation of expressions' complexities for two-terminal directed acyclic graphs
• scientific article; zbMATH DE number 3876594 (Why is no real title available?)
• On the computational complexity of graph closures
• scientific article; zbMATH DE number 2016202 (Why is no real title available?)
• On the complexity of some problems related to graph extensions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146181)