展开k页图

Q4 Mathematics 信息与控制 Pub Date : 1985-07-01 DOI:10.1016/S0019-9958(85)80008-5

Ravi Kannan

{"title":"展开k页图","authors":"Ravi Kannan","doi":"10.1016/S0019-9958(85)80008-5","DOIUrl":null,"url":null,"abstract":"<div>I show in this note that for any integer k and any k page graph G, there is an easily constructed 3-page graph G′ (called the unraveling of G) such that the minimum separator sizes of G and G′ are within a factor of k of each other. Further the maximum degree of a vertex of G′ is at most 2 plus the maximum degree of G.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 1-5"},"PeriodicalIF":0.0000,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80008-5","citationCount":"14","resultStr":"{\"title\":\"Unraveling k-page graphs\",\"authors\":\"Ravi Kannan\",\"doi\":\"10.1016/S0019-9958(85)80008-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>I show in this note that for any integer k and any k page graph G, there is an easily constructed 3-page graph G′ (called the unraveling of G) such that the minimum separator sizes of G and G′ are within a factor of k of each other. Further the maximum degree of a vertex of G′ is at most 2 plus the maximum degree of G.</div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"66 1\",\"pages\":\"Pages 1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80008-5\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 14

摘要

我在这篇笔记中表明，对于任意整数k和任意k页图G，存在一个易于构造的3页图G '(称为G的展开)，使得G和G '的最小分隔符大小在彼此的k因子范围内。更进一步，顶点G '的最大度数不超过2加上顶点G的最大度数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Unraveling k-page graphs

I show in this note that for any integer k and any k page graph G, there is an easily constructed 3-page graph G′ (called the unraveling of G) such that the minimum separator sizes of G and G′ are within a factor of k of each other. Further the maximum degree of a vertex of G′ is at most 2 plus the maximum degree of G.