default search action
"The weighted independent domination problem is NP-complete for chordal graphs."
Gerard J. Chang (2004)
- Gerard J. Chang:
The weighted independent domination problem is NP-complete for chordal graphs. Discret. Appl. Math. 143(1-3): 351-352 (2004)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.