对数空间中有界树宽图的标准化
Canonizing Graphs of Bounded Tree Width in Logspace
摘要：
图的经典化是从给定图的同构类中计算唯一代表的问题。这意味着两个图是同构的，如果他们的大炮是相等的。我们表明，有界树的宽度图可以通过代数空间（对数空间）算法来规范化。这意味着有界树宽图的同构问题可以在对数空间中决定。鉴于树的同构对于复杂性类的对数空间是困难的，这使得有界树宽度的普遍存在的图类成为同构问题的复杂性已经被精确确定的少数几类图之一。
英文摘要：
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphism class of a given graph. This implies that two graphs are isomorphic exactly if their canons are equal. We show that graphs of bounded tree width can be canonized by logarithmic-space (logspace) algorithms. This implies that the isomorphism problem for graphs of bounded tree width can be decided in logspace. In the light of isomorphism for trees being hard for the complexity class logspace, this makes the ubiquitous class of graphs of bounded tree width one of the few classes of graphs for which the complexity of the isomorphism problem has been exactly determined.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
