The induced matching and chain subgraph cover problems for convex bipartite graphs

Brandstadt A; Eschen EM; Sritharan R

首页> 外文期刊>Theoretical computer science >The induced matching and chain subgraph cover problems for convex bipartite graphs

【24h】

The induced matching and chain subgraph cover problems for convex bipartite graphs

机译：凸二部图的诱导匹配和链子图覆盖问题

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We present an O(n(2))-time algorithm for computing a maximum cardinality induced matching and a minimum cardinality cover by chain subgraphs for convex bipartite graphs. This improves the previous time bound of O(m(2)). (c) 2007 Elsevier B.V. All rights reserved.

著录项

来源
《Theoretical computer science》 |2007年第3期|共6页
作者
Brandstadt A; Eschen EM; Sritharan R;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类一般性问题;
关键词
chain cover; induced matching; convex bipartite graph;

机译：链覆盖;诱导匹配;凸二部图;

相似文献

外文文献
中文文献
专利

1. The induced matching and chain subgraph cover problems for convex bipartite graphs [J] . Brandstadt A, Eschen EM, Sritharan R Theoretical computer science . 2007,第1a3期

机译：凸二部图的诱导匹配和链子图覆盖问题
2. Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles and Matchings [J] . Jia Yuxing, Lu Mei, Zhang Yi Graphs and combinatorics . 2019,第5期

机译：完整二角形图中的抗Ramsey问题，用于T边缘不相交的彩虹跨越子图：周期和匹配
3. Orthogonal Double Covers of n,n K by Infinite Classes of Disjoint Unions of Certain Complete Bipartite Spanning Subgraphs [J] . S. El-Serafi, R. El-Shanawany, A. El-Mesady Advances in Research . 2014,第11期

机译：某些完全二部跨越子图的无穷级不交集的n，n K的正交双覆盖
4. On Maximal Chain Subgraphs and Covers of Bipartite Graphs [C] . Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, International workshop on combinatorial algorithms . 2016

机译：关于二部图的最大链子图和覆盖
5. Partition a 3-colorable graph into a small bipartite subgraph and a large independent set [D] . Wang, Qing 2011

机译：将3色图分为小二部图和大独立集
6. The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration [O] . Maarten Houbraken, Sofie Demeyer, Tom Michoel, -1

机译：具有通用对称性的基于索引的子图匹配算法（ISMAGS）：利用对称性实现更快的子图枚举
7. The induced matching and chain subgraph cover problems for convex bipartite graphs [O] . Brandstädt Andreas, Eschen Elaine M., Sritharan R. 2007

机译：凸二部图的诱导匹配和链子图覆盖问题
8. A Parallel Matching Algorithm for Convex Bipartite Graphs and Applications to Scheduling [R] . Dekel, E., Sahni, S. 1981

机译：凸二部图的并行匹配算法及其在调度中的应用

The induced matching and chain subgraph cover problems for convex bipartite graphs

摘要

著录项

相似文献

相关主题

期刊订阅