EDGE DOMINATION ON BIPARITE PERMUTATION GRAPHS AND COTRIANGULATED GRAPHS

作     者：SRINIVASAN, A MADHUKAR, K NAGAVAMSI, P RANGAN, CP CHANG, MS 

作者机构：NATL CHUNG CHENG UNIVDEPT COMP SCI & INFORMAT ENGNCHIAYI 621TAIWAN INDIAN INST TECHNOLDEPT COMP SCI & ENGNMADRAS 600036TAMIL NADUINDIA 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：1995年第56卷第3期

页      面：165-171页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：ALGORITHMS GRAPH ALGORITHMS EDGE DOMINATION BIPARTITE PERMUTATION GRAPHS 

摘      要：An edge dominating set D of graph G = (V,E) is a set of edges such that every edge not in D is adjacent to at least one edge in D. We develop polynomial time algorithms for finding a minimum edge dominating set for a cotriangulated graph and a bipartite permutation graph.