Back to Results
First PageMeta Content
NP-complete problems / Dominating set / Weight / Graph coloring / Graph theory / Theoretical computer science / Mathematics


Independent dominating sets in graphs of girth five Ararat Harutyunyan∗ Paul Horn†
Add to Reading List

Document Date: 2010-09-24 16:29:59


Open Document

File Size: 205,18 KB

Share Result on Facebook

City

La Jolla / /

Company

3M / /

Country

United States / /

/

Facility

University of California / Emory University / /

IndustryTerm

randomized greedy algorithm / probabilistic tools / /

Organization

Emory University / Department of Mathematics / Simon Fraser University Department of Mathematics and Computer Science / National Science Foundation / University of California at San Diego / /

Person

Paul Horn / Jacques Verstraete‡ June / Let Zt / /

/

Product

Beyerdynamic DT 100 Headphone/Headset / Pentax K-x Digital Camera / /

ProvinceOrState

California / /

Technology

randomized greedy algorithm / /

SocialTag