Year: 2017
Type: preprint
Abstract: AT-free graphs are characterized by vertex elimination orders. We show that these AT-free orders of a graph can be generated in constant amortized time.
Source: arXiv (Cornell University)
Authors: Chang, Jou-Ming, Kloks, Ton, Wang, Hung-Lung
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2803724927