A FAST ALGORITHM FOR FINDING AN EDGE-MAXIMAL SUBGRAPH WITH A TR-FORMATIVE COLORING

被引：11

作者：

BALAS, E

机构：

[1] Carnegie-Mellon Univ, Pittsburgh,, PA, USA, Carnegie-Mellon Univ, Pittsburgh, PA, USA

来源：

DISCRETE APPLIED MATHEMATICS | 1986年 / 15卷 / 2-3期

关键词：

*The research underlying this paper was supported by Grant ECS-8503192 of the National Science Foundation and Contract N00014-85-K-0198 with the U.S. Office of Naval Research;

D O I：

10.1016/0166-218X(86)90036-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：123 / 134

页数：12