An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger. An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica, 72(3):836-859, 2015. [doi]

This author has not been identified. Look up 'Petr A. Golovach' in GoogleThis author has not been identified. Look up 'Pinar Heggernes' in GoogleThis author has not been identified. Look up 'Dieter Kratsch' in GoogleThis author has not been identified. Look up 'Yngve Villanger' in Google

runs on WebDSL