Your search returned 2 results.

Sort
Results
Maximum matching in the online preemptive model, and approximability of the minimum rainbow subgraph problem (R) by
Language: English
Publication details: Bombay ; IIT ; 2017
Dissertation note: Thesis Ph.D Indian Institute of Technology Bombay. Department of Computer Science and Engineering 2017
Availability: Items available for reference: Central Library, IITB: Not for loan (1)Call number: 043:681.3.06:518.4Tir.

Some coloring, labeling and partitioning problems on graphs (R) by
Language: English
Publication details: Bombay ; IIT ; 2009
Dissertation note: Thesis Ph.D Indian Institute of Technology Bombay. Department of Computer Science and Engineering 2009
Availability: Items available for reference: Central Library, IITB: Not for loan (1)Call number: 043:681.3.06:518.4 Ken.