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

An algorithm for enumerating simple chains in a graph

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

DOI10.1016/0041-5553(75)90191-3zbMATH Open0333.05113OpenAlexW1968721354MaRDI QIDQ4100114FDOQ4100114


Authors: L. I. Kicha, Eugene I. Litvak Edit this on Wikidata


Publication date: 1976

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(75)90191-3





Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Algorithms in computer science (68W99)







This page was built for publication: An algorithm for enumerating simple chains in a graph

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

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