4.2 Article

Simplicity in Eulerian circuits: Uniqueness and safety

相关参考文献

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

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph

Massimo Cairo et al.

ACM TRANSACTIONS ON ALGORITHMS (2019)

Article Biochemical Research Methods

Parametric Complexity of Sequence Assembly: Theory and Applications to Next Generation Sequencing

Niranjan Nagarajan et al.

JOURNAL OF COMPUTATIONAL BIOLOGY (2009)