DECIDING WHETHER GRAPH-G HAS PAGE NUMBER ONE IS IN NC

被引：2
|
作者：
MASUYAMA, S [1 ]
NAITO, S [1 ]
机构：
[1] NIPPON TELEGRAPH & TEL PUBL CORP, MUSASHINO ELECT COMMUN LAB, BASIC RES LABS, MUSASHINO, TOKYO 180, JAPAN
来源：
INFORMATION PROCESSING LETTERS | 1992年 / 44卷 / 01期
关键词：
PARALLEL ALGORITHMS; CLASS NC; PAGE NUMBER ONE; BOOK EMBEDDING; PARALLEL GRAPH ALGORITHM; CHARACTERIZATION BY FORBIDDEN SUBGRAPHS; GRAPH THEORY;
D O I：
10.1016/0020-0190(92)90247-S
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Based on a forbidden subgraph characterization of a graph to have one page, we develop a polylog time algorithm to tell if a given graph G has page number one, with polynomial number of processors, clarifying this problem to be in NC.
引用
收藏
页码：7 / 10
页数：4
相关论文
共 4 条
1