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

k-distinct lattice paths

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

zbMATH Open1536.05018MaRDI QIDQ6539451FDOQ6539451


Authors: Marcus Engstrom, Eric Yager Edit this on Wikidata


Publication date: 14 May 2024

Published in: Undergraduate Math Journal (Search for Journal in Brave)





Recommendations

  • Enumerating and constructing essentially equivalent lattice paths
  • From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
  • On the edge set of graphs of lattice paths
  • Heuristics for finding a maximum number of disjoint bounded paths
  • Lattices and maximum flow algorithms in planar graphs


zbMATH Keywords

efficient algorithmscounting paths


Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of groups and algebras (05E16)







This page was built for publication: \(k\)-distinct lattice paths

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

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