Counting the number of vertex covers in a trapezoid graph-Reference-Cited by-同舟云学术

Counting the number of vertex covers in a trapezoid graph

Published:2009-10 Issue:21-22 Volume:109 Page:1187-1192
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Lin Min-Sheng,Chen Yung-Jui

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference21 articles.

1. Chaining algorithms for multiple genome comparison;Abouelhoda;Journal of Discrete Algorithms,2005

2. An efficient algorithm to generate all maximal cliques on trapezoid graphs;Bera;Int. J. Comput. Math.,2002

3. J. Chen, I.A. Kanj, G. Xia, Simplicity is beauty: Improved upper bounds for vertex cover, Technical Report TR05-008, School of CTI, DePaul University, 2005

4. D.G. Corneil, P.A. Kamula, Extensions of permutation and interval graphs, in: Proceedings of 18th Southeastern Conference on Combinatorics, Graph Theory and Computing, 1987, pp. 267–275

5. A note on the size of minimal covers;Costa;Information Processing Letters,2007

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Simple linear-time algorithms for counting independent sets in distance-hereditary graphs;Discrete Applied Mathematics;2018-04

2. Efficient maximum matching algorithms for trapezoid graphs;Electronic Journal of Graph Theory and Applications;2017-04

3. The hub number of co-comparability graphs;Theoretical Computer Science;2015-03

4. Counting independent sets in a tolerance graph;Discrete Applied Mathematics;2015-01

5. Counting maximal independent sets in directed path graphs;Information Processing Letters;2014-10