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

Optimal jumping patterns

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

zbMATH Open1234.05070MaRDI QIDQ2880101FDOQ2880101


Authors: Steve Butler, Nan Zang, Ron Graham Edit this on Wikidata


Publication date: 12 April 2012

Published in: Journal of Combinatorics and Number Theory (Search for Journal in Brave)





Recommendations

  • Jumping sequences
  • An optimal algorithm for finding all the jumps of a monotone step-function
  • An optimal algorithm to find the jump number of partially ordered sets
  • Sequential Partitioning
  • AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST


zbMATH Keywords

cost functionjump lengthsoptimal jumpimg patterns


Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Recurrences (11B37)



Cited In (1)

  • Jumping sequences





This page was built for publication: Optimal jumping patterns

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

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