{"title":"在网格上画有标记的有向二值图","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":"{\"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}","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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
