Skip to content

Gray codes for AT-free orders via antimatroids

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The AT-free order is a linear order of the vertices of a graph the existence of which characterizes AT-free graphs. We show that all AT-free orders of an AT-free graph can be generated in O(1) amortized time.

Cite

CITATION STYLE

APA

Chang, J. M., Kloks, T., & Wang, H. L. (2016). Gray codes for AT-free orders via antimatroids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9538, pp. 77–87). Springer Verlag. https://doi.org/10.1007/978-3-319-29516-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free