Author:
Chang Gerard J.,Panda B.S.,Pradhan D.
Subject
General Computer Science,Theoretical Computer Science
Reference32 articles.
1. Characterization of totally balanced matrices;Anstee;J. Algorithms,1984
2. A linear time algorithm for finding the minimum paired-dominating set in series–parallel graphs;Araki;Inf. Process. Soc. Japan (IPSJ),2007
3. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999
4. Characterizations of trees with equal paired and double domination numbers;Blidia;Discrete Math.,2006
5. A characterisation of rigid circuit graphs;Buneman;Discrete Math.,1974
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献