Searching for "A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
by B Er, G E Nsis, Serge Gaspers, Serge Gaspers, Mathieu Liedloff, Mathieu Liedloff — 2006 — In Graph-Theoretic Concepts in Computer Science (WG
… Bergen, Norway A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB