Min-Sheng Lin

MaRDI QIDQ195283zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Counting dominating sets in some subclasses of bipartite graphs Theoretical Computer Science	2022-06-13	Paper
Fast and simple algorithms for counting dominating sets in distance-hereditary graphs Discrete Mathematics, Algorithms and Applications	2021-11-25	Paper
Counting dominating sets in generalized series-parallel graphs Discrete Mathematics, Algorithms and Applications	2020-01-02	Paper
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs Discrete Applied Mathematics	2018-12-03	Paper
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs Discrete Applied Mathematics	2018-03-21	Paper
Linear-time algorithms for counting independent sets in bipartite permutation graphs Information Processing Letters	2017-11-03	Paper
Counting independent sets in tree convex bipartite graphs Discrete Applied Mathematics	2016-12-28	Paper
The computational complexity of the reliability problem on distributed systems Information Processing Letters	2016-05-26	Paper
Computing the \(K\)-terminal reliability of directed path graphs Information Processing Letters	2015-06-15	Paper
A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs Information Processing Letters	2014-12-09	Paper
Counting independent sets in a tolerance graph Discrete Applied Mathematics	2014-12-05	Paper
Counting maximal independent sets in directed path graphs Information Processing Letters	2014-06-23	Paper
Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs Information Processing Letters	2014-04-14	Paper
Counting the number of vertex covers in a trapezoid graph Information Processing Letters	2010-09-01	Paper
Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph Information Processing Letters	2010-04-19	Paper
Fast and simple algorithms to count the number of vertex covers in an interval graph Information Processing Letters	2010-01-29	Paper
Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems. Computers & Operations Research	2004-02-14	Paper
The distributed program reliability analysis on ring-type topologies Computers & Operations Research	2001-10-23	Paper
The disributed program reliability analysis on star topologies Computers & Operations Research	2000-09-26	Paper
The Reliability Analysis of Distributed Computing Systems with Imperfect Nodes The Computer Journal	2000-05-04	Paper

Research outcomes over time

This page was built for person: Min-Sheng Lin