Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
Year of publication: |
2013
|
---|---|
Authors: | Panda, B. S. ; Pradhan, D. |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 4, p. 770-785
|
Subject: | Perfect matching | Paired-domination | Chordal bipartite graphs | Perfect elimination bipartite graphs | NP-complete | Graphentheorie | Graph theory |
-
Using shortcut edges to maximize the number of triangles in graphs
Dehghani, Sina, (2015)
-
Shen, Siqian, (2015)
-
NP-completeness of cell formation problem with grouping efficacy objective
Batsyn, Mikhail, (2020)
- More ...
-
The effect of memory-management policies on system reliability
Bowen, N., (1993)
- More ...