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

scientific article; zbMATH DE number 876677

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

zbMATH Open0855.68001MaRDI QIDQ4877161FDOQ4877161


Authors: Martin Russling Edit this on Wikidata


Publication date: 8 May 1996



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



Recommendations

  • Deriving a class of layer-oriented graph algorithms
  • scientific article; zbMATH DE number 1210362
  • scientific article; zbMATH DE number 1498519
  • Two Algorithms For Languages Recognized By Graph Algebras


zbMATH Keywords

graph algorithmsKleene algebraHamiltonian circuitsalgebra of formal languages


Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)



Cited In (3)

  • On the speed of algebraically defined graph classes
  • Using relations to develop a Haskell program for computing maximum bipartite matchings
  • Title not available (Why is that?)





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 Q4877161)

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