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

Basic graph algorithms

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

zbMATH Open1388.05180MaRDI QIDQ4635956FDOQ4635956


Authors: Krishnaiyan Thulasiraman Edit this on Wikidata


Publication date: 23 April 2018





Recommendations

  • Publication:3477976
  • scientific article
  • scientific article; zbMATH DE number 3906496
  • scientific article; zbMATH DE number 3988689
  • Basic concepts in graph theory and algorithms


zbMATH Keywords

computational complexity


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)







This page was built for publication: Basic graph algorithms

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

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