Algorithms and Complexity on Indexing Founder Graphs.
Massimo EquiTuukka NorriJarno AlankoBastien CazauxAlexandru I. TomescuVeli MäkinenPublished in: Algorithmica (2023)
Keyphrases
- shortest path
- graph search
- data structure
- computational complexity
- computational cost
- worst case
- learning algorithm
- representational power
- orders of magnitude
- graph theory
- computationally efficient
- theoretical analysis
- lower complexity
- high computational complexity
- access methods
- polynomial time complexity
- graph properties
- indexing method
- indexing structure
- space complexity
- memory requirements
- index structure
- constraint satisfaction problems
- lower bound