Loading...
Please wait, while we are loading the content...
Similar Documents
All-Pairs Shortest-Paths Problem for Unweighted Graphs in O(n2 log n) Time
| Content Provider | Semantic Scholar |
|---|---|
| Author | R. Udaya Kumar Reddy K. Iyer, K. Viswanathan |
| Copyright Year | 2009 |
| Abstract | The invention relates to transparent, impact-resistant thermoplastic molding materials containing A) a matrix consisting of at least two different mixture components, B) an impact-resistance modifier, C) an additive, essentially consisting of c1) at least one 2,6-disubstituted phenol, and c21) at least one organic phosphite of general formula (I) P(OR )n(OAr)3-n, c22 at least one organic phosphite of general formula (IIa) and/or (IIb), or c23) a mixture of compounds in accordance with c21) and c22). |
| Starting Page | 320 |
| Ending Page | 326 |
| Page Count | 7 |
| File Format | PDF HTM / HTML |
| Volume Number | 3 |
| Alternate Webpage(s) | http://www.waset.org/journals/waset/v26/v26-86.pdf |
| Alternate Webpage(s) | http://waset.org/publications/8870/all-pairs-shortest-paths-problem-for-unweighted-graphs-in-o-n2-log-n-time |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
