The heaviest induced ancestors problem: better data structures and applications
From MaRDI portal
Publication:2149106
DOI10.1007/S00453-022-00955-7OpenAlexW4220713634MaRDI QIDQ2149106FDOQ2149106
Authors: Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan 
Publication date: 28 June 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00955-7
Recommendations
- The heaviest induced ancestors problem revisited
- All-Pairs Ancestor Problems in Weighted Dags
- New common ancestor problems in trees and directed acyclic graphs
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- A Data Structure for Nearest Common Ancestors with Linking
- scientific article; zbMATH DE number 7695994
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
- Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
- An efficient algorithm for the length-constrained heaviest path problem on a tree
- On two restricted ancestors tree problems
Cites Work
- Algorithms on Strings, Trees and Sequences
- Indexing compressed text
- Title not available (Why is that?)
- Fully-functional succinct trees
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- A universal algorithm for sequential data compression
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Orthogonal range searching on the RAM, revisited
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Sorted range reporting
- Fast Algorithms for Finding Nearest Common Ancestors
- Data structures for range median queries
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Cartesian trees and range minimum queries
- Two-dimensional range successor in optimal time and almost linear space
- Repetition Detection in a Dynamic String
- Minimal unique palindromic substrings after single-character substitution
- Dynamic and internal longest common substring
- Computing longest palindromic substring after single-character or block-wise edits
- Longest common substring made fully dynamic
- Locally maximal common factors as a tool for efficient dynamic string algorithms
- Longest substring palindrome after edit
- Longest Lyndon Substring After Edit
- The heaviest induced ancestors problem revisited
- Longest common factor after one edit operation
- Searching for a modified pattern in a changing text
Cited In (4)
This page was built for publication: The heaviest induced ancestors problem: better data structures and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149106)
