๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs

โœ Scribed by Ruo-Wei Hung

Publisher
Springer
Year
2011
Tongue
English
Weight
809 KB
Volume
50
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial algorithm for the extendabi
A polynomial algorithm for the extendability problem in bipartite graphs
โœ J. Lakhal; L. Litzler ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 587 KB

Let G = [ y E] be a simple connected graph and let k be an integer such that 0 < k < 1 VI /2. G is said to be k-extendable if it contains a perfect matching and every matching of k edges extends to, i.e. is a subset of, a perfect matching. The extendability problem consists in finding the maximum va

Parallel algorithms for the domination p
Parallel algorithms for the domination problems in trapezoid graphs
โœ Y.Daniel Liang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR