Drawing labelled directed binary graphs on a grid

ACM-SE 20 Pub Date : 1982-04-01 DOI:10.1145/503896.503903
R. I. Becker, S. Schach
{"title":"Drawing labelled directed binary graphs on a grid","authors":"R. I. Becker, S. Schach","doi":"10.1145/503896.503903","DOIUrl":null,"url":null,"abstract":"A directed graph in which there is a bound for the degrees of the vertices is called labelled i f each edge is assigned a label from a f in i te set of labels, the edges emerging from a given vertex al l having distinct labels. Knuth [2] gives a wellknown transformation to represent an arbitrary rooted tree by means of a labelled binary tree. (He calls each edge either a \"brother\" or a \"son\", so the label set is {brother, son}) . The binary tree contains al l information of the original tree, and the lat ter can be reconstructed from the former.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 20","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/503896.503903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A directed graph in which there is a bound for the degrees of the vertices is called labelled i f each edge is assigned a label from a f in i te set of labels, the edges emerging from a given vertex al l having distinct labels. Knuth [2] gives a wellknown transformation to represent an arbitrary rooted tree by means of a labelled binary tree. (He calls each edge either a "brother" or a "son", so the label set is {brother, son}) . The binary tree contains al l information of the original tree, and the lat ter can be reconstructed from the former.
在网格上画有标记的有向二值图
如果有一个有向图中顶点的度数有一个界限,那么这个有向图被称为有标签的图i,如果每条边都从标签集合中的一个f中被分配一个标签,从给定顶点产生的边都有不同的标签。Knuth[2]给出了一个众所周知的用标记二叉树表示任意根树的变换。(他称每条边为“兄弟”或“儿子”,所以标签集是{brother, son})。二叉树包含了原树的全部信息,原树可以重构成原树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信