Gray codes for AT-free orders via antimatroids

Jou Ming Chang, Ton Kloks, Hung Lung Wang*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 26th International Workshop, IWOCA 2015, Revised Selected Papers
EditorsWilliam F. Smyth, Zsuzsanna Liptak
PublisherSpringer Verlag
Pages77-87
Number of pages11
ISBN (Print)9783319295152
DOIs
Publication statusPublished - 2016
Externally publishedYes
Event26th International Workshop on Combinatorial Algorithms, IWOCA 2015 - Verona, Italy
Duration: 2015 Oct 52015 Oct 7

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9538
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Workshop on Combinatorial Algorithms, IWOCA 2015
Country/TerritoryItaly
CityVerona
Period2015/10/052015/10/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Gray codes for AT-free orders via antimatroids'. Together they form a unique fingerprint.

Cite this