GENERATION OF MAXIMUM INDEPENDENT SETS OF A BIPARTITE GRAPH AND MAXIMUM CLIQUES OF A CIRCULAR-ARC GRAPH

被引：15
|
作者：
KASHIWABARA, T
MASUDA, S
NAKAJIMA, K
FUJISAWA, T
机构：
[1] OSAKA UNIV,DEPT INFORMAT & COMP SCI,TOYONAKA,OSAKA 560,JAPAN
[2] UNIV MARYLAND,INST ADV COMP STUDIES,DEPT ELEC ENGN,COLLEGE PK,MD 20742
[3] UNIV MARYLAND,SYST RES CTR,COLLEGE PK,MD 20742
来源：
JOURNAL OF ALGORITHMS | 1992年 / 13卷 / 01期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/0196-6774(92)90012-2
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present an efficient algorithm for generating all maximum independent sets of a bipartite graph. Its time complexity is O(n2.5 + (output size)), where n is the number of vertices of a given graph. As its application, we develop an algorithm for generating all maximum cliques of a circular-arc graph. When the graph is given in the form of a family of n arcs on a circle, this algorithm runs in O(n3.5 + (output size)) time. © 1992.
引用
收藏
页码：161 / 174
页数：14
相关论文
共 50 条
12345