Pages that link to "Item:Q385514"
From MaRDI portal
The following pages link to Log-space algorithms for paths and matchings in \(k\)-trees (Q385514):
Displaying 5 items.
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Bounded Treewidth and Space-Efficient Linear Algebra (Q2948475) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)
