Sciweavers

3 search results - page 1 / 1
» Enumerating minimal dominating sets in chordal bipartite gra...
Sort
View
DAM
1999
119views more  DAM 1999»
13 years 5 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
ICTAI
2006
IEEE
13 years 11 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...
TIT
2010
103views Education» more  TIT 2010»
13 years 4 days ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...