【24h】

On Module-Composed Graphs

机译:在模块组成的图上

获取原文
获取原文并翻译 | 示例

摘要

In this paper we introduce module-composed graphs, i.e. graphs which can be defined by a sequence of one-vertex insertions υ1,... ,υn, such that the neighbourhood of vertex υi, 2 ≤ i ≤ n, forms a module of the graph defined by vertices υ1,..., υi-1. We show that module-composed graphs are HHDS-free and thus homogeneously orderable, weakly chordal, and perfect. Every bipartite distance hereditary graph and every trivially perfect graph is module-composed. We give an (O)(|V| ? (|V| + |E|)) time algorithm to decide whether a given graph G = (V, E) is module-composed and construct a corresponding module-sequence. For the case of bipartite graphs, we show that the set of module-composed graphs is equivalent to the well known class of distance hereditary graphs, which implies linear time algorithms for their recognition and construction of a corresponding module-sequence using BFS and Lex-BFS.
机译:在本文中,我们介绍由模块组成的图,即可以由一系列单顶点插入υ1,...,υn定义的图,使得顶点υi,2≤i≤n的邻域形成由顶点υ1,...,υi-1定义的图。我们显示模块组成的图是无HHDS的,因此可均匀排序,弱和弦且完美。每个二分距离遗传图和每个平凡完美的图都是由模块组成的。我们给出(O)(| V |?(| V | + | E |))时间算法,以确定给定图G =(V,E)是否由模块组成,并构造相应的模块序列。对于二部图,我们证明了模块组成图的集合等同于众所周知的距离遗传图类,这暗示了线性时间算法可以识别它们并使用BFS和Lex-构造相应的模块序列。 BFS。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号