The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
Authors:
- Fu-Tao HuFHFu-Tao Hu
- Moo Young SohnMSMoo Young Sohn
- 1 May 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 535, 46-53
Abstract
No abstract availableAll Related Versions
Funding Information
- Natural Science Foundation of Anhui Province (1408085QA03)
- Ministry of Education, Science and Technology (2012R1A1A2005115)
- Anhui University (12333190252)
- National Research Foundation of Korea
This publication has 9 references indexed in Scilit:
- On the complexity of the bondage and reinforcement problemsJournal of Complexity, 2012
- A note on total reinforcement in graphsDiscrete Applied Mathematics, 2011
- Reinforcement numbers of digraphsDiscrete Applied Mathematics, 2009
- A survey of selected recent results on total domination in graphsDiscrete Mathematics, 2009
- Restrained bondage in graphsDiscrete Mathematics, 2008
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphsComputers & Mathematics with Applications, 2007
- The bondage number of a graphDiscrete Mathematics, 1990
- The NP-completeness of steiner tree and dominating set for chordal bipartite graphsTheoretical Computer Science, 1987
- Total domination in graphsNetworks, 1980