k-distinct lattice paths

MaRDI QIDQ6539451zbMATH OpenFDO

Authors Marcus Engstrom, Eric Yager

Publication date 14 May 2024

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

zbMATH Keywords

efficient algorithmscounting paths

Mathematics Subject Classification ID

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

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

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)