Titlebook: Reviews of Environmental Contamination and Toxicology Volume 233; David M. Whitacre Book 2015 Springer International Publishing Switzerlan

拖累

書目名稱Reviews of Environmental Contamination and Toxicology Volume 233影響因子(影響力)




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233影響因子(影響力)學科排名




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233網(wǎng)絡公開度




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233網(wǎng)絡公開度學科排名




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233被引頻次




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233被引頻次學科排名




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233年度引用




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233年度引用學科排名




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233讀者反饋




書目名稱Reviews of Environmental Contamination and Toxicology Volume 233讀者反饋學科排名

ethereal

dragon

https://doi.org/10.1007/978-3-319-10479-9Chitosan; Hexavalent Chromium Resistance; Ozone Phytotoxicity; Seafood waste; Street Sweeping; ecotoxicol

extinguish

978-3-319-36289-2Springer International Publishing Switzerland 2015

清晰

包租車船

不近人情

Uehara by showing that we can decide in polynomial time whether an independent set . of an interval graph can be transformed into another independent set .. Moreover, we answer similar questions by showing that: (i) determining if there exists a token sliding transformation between every pair of .-i

Condescending

Soon Kong Yong,Manoj Shrivastava,Prashant Srivastava,Anitha Kunhikrishnan,Nanthi Bolans for treewidth, pathwidth, search number, vertex search number, node search number, cutwidth, modified cutwidth, vertex separation number, gate matrix layout, and progressive black-white pebbling, where in each case the parameter . is a fixed constant.

不如樂死去

阻止

Steven J. Calvillo,E. Spencer Williams,Bryan W. Brooksl the search numbers above. More precisely, for any graph ., .(.)?=?.(.)?=?.(.)?≤?.(.)?≤?.(.)?=?.(.)?≤?.(.)?=?.(.). The first two inequalities can be strict. Motivated by the fact that connected graph searching and monotone internal graph searching are both minor closed ., we provide a complete char