Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 7300406

From MaRDI portal
Publication:5146181
Jump to:navigation, search

MaRDI QIDQ5146181FDOQ5146181


Authors: M. B. Abrosimov Edit this on Wikidata


Publication date: 25 January 2021


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

Title of this publication is not available (Why is that?)




Mathematics Subject Classification ID

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


Cites Work

  • A Graph Model for Fault-Tolerant Computing Systems
  • Edge fault tolerance in graphs
  • Title not available (Why is that?)


Cited In (5)

  • On the complexity of some problems related to graph extensions
  • Estimation of expressions' complexities for two-terminal directed acyclic graphs
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • On the computational complexity of graph closures





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5146181&oldid=19692947"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 14:50. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki