Live briefing
Everything about Order-maintenance problem
Computer science challenge
In computer science, the order-maintenance problem involves maintaining a totally ordered set supporting the following operations:insert(X, Y), which inserts X immediately after Y in the total order; order(X, Y), which determines if X precedes Y in the total order; and delete(X), which removes X from the set. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Order-maintenance problemA 5-minute orientation
- Pick up a classic book: American FilmThe most-reprinted book on the subject
- Read the landmark paper: Order based algorithms for the core maintenance problem on edge-weighted graphsCited 6 times
- Go sideways: List-labeling problemA closely related topic
- Go sideways: Self-balancing binary search treeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
American FilmAmerican Film Institute · 1975
Intelligence BulletinUnited States. War Department. Military Intelligence Service · 1942
Police AdministrationGary W. Cordner, Kathryn E. Scarborough · 1999
Modern automotive technologyDuffy, James E., James E. Duffy · 1993
Operations ManagementRoberta S. Russell, Bernard Taylor · 1998
You mean I'm not lazy, stupid or crazy?!Kate Kelly, Peggy Ramundo · 1993
Introduction to PolicingSteven M. Cox, Susan Marchionna · 2013
Bayesian analysis of stochastic process modelsFabrizio Ruggeri · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- List-labeling problem In computer science, the list-labeling problem involves maintaining a totally ordered set S supporting the following operations: insert(X), which inserts…
- Self-balancing binary search tree In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number…
- Splay tree A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary…
- Fractional cascading In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures…
- Disjoint-set data structure In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection…
- Binomial heap In computer science, a binomial heap is a data structure that acts as a priority queue. It is an example of a mergeable heap (also called meldable heap)…
- Persistent data structure In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when…
- Interval tree In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap…