Normal view MARC view ISBD view

Finding Transitive Subgraphs and Counting Popular Matchings Nitesh Jha.

Material type: Text

TextPublisher: Chennai; Chennai Mathematical Institute. July 2017Description: xv, 61 pages ill.; 29 cms.Subject(s): Graph Theory. -- Approximation AlgorithmsOnline resources: Click here to access online

List(s) this item appears in: 2017-10-11

Item type	Current location	Call number	Status	Date due	Barcode	Item holds
Reports/Dissertations	Chennai Mathematical Institute General Stacks	T JHA (Browse shelf)	Available		10208

Total holds: 0

Previous	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	Next
Previous	T GHA Flexible surfaces in 4-manifolds and embeddings of low dimensional manifolds	T GHO Asymptotic Symmetries, Horizon Hairm and Memory Effect	T JAY Sorting and Selection in Restricted Models	T JHA Finding Transitive Subgraphs and Counting Popular Matchings	T KAM Robustness of Neural Network Models	T KAR Subwords: automata, embedding problems, and verification.	T KLO Saamaka uwii saramacan medical plant knowledge, practices and beliefs for local health care in suriname.	Next

Univ. - Chennai Mathematical Institute; Degree - PhD Computer Science; Sub. on - July 2017. Guide - Prof. Sourav Chakraborty.

CMI Library