Filters








4 Hits in 1.5 sec

Page 5767 of Mathematical Reviews Vol. , Issue 97I [page]

1997 Mathematical Reviews  
.” 971:68156 68R10 05C15 05SC85 68N20 68Q25 Venkatesan, G. (6-IITM-C; Madras); Pandu Rangan, C. (6-I1ITM-C; Madras) Approximate triclique coloring for register allocation.  ...  We then proceed to give a factor 1.5-approximation algorithm for the coloring problem on tricliques.  ... 

Page 149 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(with Pandu Rangan, Chandrasekaran) Approximate triclique coloring for register allocation.  ...  Randomised approximation schemes for Tutte-Gréthendieck invariants. 97b:68098 — Counting colourings and flows in random graphs. (English summary) 974:05155 de Werra, D. (with Solot, P.)  ... 

Page 1483 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(with Pandu Rangan, Chandrasekaran) Approximate triclique coloring for register allocation. (English summary) 971:68156 Vrto, Imrich see Rolim, José D. P.; et al., 97e:68100 Wagh, Meghanad D.  ...  (English summary) (see 97k:68011) Zhou, Xiao (with Nishizeki, Takao) Algorithms for finding / colorings of partial k -trees (an extended abstract).  ... 

Page 1516 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(Summary) 97d:05066 05C05 — (with Pandu Rangan, Chandrasekaran) Approximate triclique coloring for register allocation. (English summary) Jnform. Process. Lett. 60 (1996), no. 5, 249-253.  ...  A constant-factor approximation algorithm for the k-MST problem (extended abstract).  ...