Gray Codes for AT-Free Orders

Jou Ming Chang Ton Kloks; Hung Lung Wang

Gray Codes for AT-Free Orders

Jou Ming Chang Ton Kloks, Hung Lung Wang^*

^*此作品的通信作者

資訊工程學系

研究成果: 雜誌貢獻 › 期刊論文 › 同行評審

摘要

at-free graphs are characterized by vertex elimination orders- We show that these at-free orders of a graph can be gen- erated in constant amortized time.

原文	英語
頁（從 - 到）	273-284
頁數	12
期刊	Ars Combinatoria
卷	155
出版狀態	已發佈 - 2021 1月

ASJC Scopus subject areas

數學(全部)

其它文件與鏈接

引用此

@article{5b7e7ddb49734dc2bcec4a658f135bfb,

title = "Gray Codes for AT-Free Orders",

abstract = "at-free graphs are characterized by vertex elimination orders- We show that these at-free orders of a graph can be gen- erated in constant amortized time.",

author = "Kloks, {Jou Ming Chang Ton} and Wang, {Hung Lung}",

year = "2021",

month = jan,

language = "English",

volume = "155",

pages = "273--284",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Gray Codes for AT-Free Orders

AU - Kloks, Jou Ming Chang Ton

AU - Wang, Hung Lung

PY - 2021/1

Y1 - 2021/1

N2 - at-free graphs are characterized by vertex elimination orders- We show that these at-free orders of a graph can be gen- erated in constant amortized time.

AB - at-free graphs are characterized by vertex elimination orders- We show that these at-free orders of a graph can be gen- erated in constant amortized time.

UR - http://www.scopus.com/inward/record.url?scp=85112105475&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85112105475&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85112105475

SN - 0381-7032

VL - 155

SP - 273

EP - 284

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Gray Codes for AT-Free Orders

摘要

ASJC Scopus subject areas

其它文件與鏈接

指紋

引用此