簡潔データ構造
1. Succinct data structureIn computer science, a succinct data structure is data structure which uses an amount of space that is "close" to the information-theoretic lower bound, but (unlike other compressed representations) still allows for efficient query operations. The concept was originally introduced by Jacobson to encode bit vectors, (unlabeled) trees, and planar graphs.
Read “Succinct data structure” on English Wikipedia
Read “簡潔データ構造” on Japanese Wikipedia
Read “Succinct data structure” on DBpedia
Read “Succinct data structure” on English Wikipedia
Read “簡潔データ構造” on Japanese Wikipedia
Read “Succinct data structure” on DBpedia
Discussions
Log in to talk about this word.