4.3 Article

Space efficient algorithm for solving reachability using tree decomposition and separators

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs

Diptarka Chakraborty et al.

ACM TRANSACTIONS ON COMPUTATION THEORY (2018)

Article Computer Science, Hardware & Architecture

Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs

Fang Wei-Kleiner

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2016)

Article Computer Science, Theory & Methods

Log-Space Algorithms for Paths and Matchings in k-Trees

Bireswar Das et al.

THEORY OF COMPUTING SYSTEMS (2013)

Article Computer Science, Hardware & Architecture

Undirected connectivity in log-space

Omer Reingold

JOURNAL OF THE ACM (2008)

Article Computer Science, Theory & Methods

Improved approximation algorithms for minimum weight vertex separators

Uriel Feige et al.

SIAM JOURNAL ON COMPUTING (2008)

Article Computer Science, Hardware & Architecture

Combinatorial optimization on graphs of bounded treewidth

Hans L. Bodlaender et al.

COMPUTER JOURNAL (2008)