{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T12:43:10Z","timestamp":1730292190892,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/rait.2018.8389077","type":"proceedings-article","created":{"date-parts":[[2018,6,25]],"date-time":"2018-06-25T19:25:44Z","timestamp":1529954744000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Content matching problem in large scale network using weighted b-matching algorithm"],"prefix":"10.1109","author":[{"given":"Parul","family":"Chak","sequence":"first","affiliation":[]},{"given":"Ranjan Kumar","family":"Behera","sequence":"additional","affiliation":[]},{"given":"Debadatta","family":"Naik","sequence":"additional","affiliation":[]},{"given":"Santanu Kumar","family":"Rath","sequence":"additional","affiliation":[]},{"given":"Dharavath","family":"Ramesh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"519","article-title":"New effective multithreaded matching algorithm","author":"halappanvar","year":"2014","journal-title":"Parallel and Distributed Processing Symposium 2014 IEEE 28th International"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"george","year":"1998","journal-title":"SIAM J Sci Comput"},{"key":"ref12","first-page":"242","article-title":"SANDERS, Engineering algorithms for approximate weighted matching","author":"jens","year":"2007","journal-title":"Experimental Algorithms"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01584376","article-title":"Solving matching problems with linear programming","volume":"33","author":"holland","year":"1985","journal-title":"Math Prog"},{"key":"ref14","first-page":"1","article-title":"Linear-time approximation for maximum weight matching","volume":"61","author":"ruan","year":"2014","journal-title":"Journal of the ACM"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2517-1_48"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02240072"},{"key":"ref17","first-page":"3192","article-title":"Adaptive anonymity via b-matching","author":"choromanski","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref18","article-title":"Large scale robust adaptive anonymity via b-edge cover and parallel computation","author":"choromanski","year":"2015","journal-title":"Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.7.3.298"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00393-9"},{"key":"ref4","first-page":"259","article-title":"Linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs","author":"robert","year":"1998","journal-title":"Symposium on Theoretical Aspects of Computer Science STACS 99"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-015-1735-5"},{"key":"ref3","article-title":"Faces of matching polyhydra","author":"pulleyblank","year":"1973","journal-title":"PhD theseis"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/net.3230130404","article-title":"A survey of heuristics for the weighted matching problem","volume":"13","author":"david","year":"1983","journal-title":"Networks"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31464-3_29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18293\/SEKE2017-100"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/1988776.1988782"},{"key":"ref2","article-title":"Combinitorial Optimization-Polyhedra nad Efficiency.","author":"alexander","year":"2003","journal-title":"Volume A Paths Flows Matchings"},{"key":"ref9","first-page":"679","author":"tony","year":"2006","journal-title":"b-matching for spectral clustring in Europe Conference on Machine Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90178-5"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","article-title":"Odd minimum cut-sets and b-matchings","volume":"7","author":"rao","year":"1982","journal-title":"Math Oper Res"},{"key":"ref21","article-title":"Implementing weighted b-matching algorithms: Insights from a computational study","volume":"5","author":"hannemann","year":"2000","journal-title":"J Exp Algorithmics"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.05.035"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_19"},{"key":"ref26","first-page":"448","article-title":"An efficient reduction technique for degree-constrained subgraph and bidirected network ow problems","author":"gabow","year":"1983","journal-title":"Proc 15th Annu ACM Sympos Theory Comput"},{"journal-title":"Matching Algorithms","year":"1979","author":"marsh","key":"ref25"}],"event":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","start":{"date-parts":[[2018,3,15]]},"location":"Dhanbad","end":{"date-parts":[[2018,3,17]]}},"container-title":["2018 4th International Conference on Recent Advances in Information Technology (RAIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8376941\/8388962\/08389077.pdf?arnumber=8389077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T18:35:26Z","timestamp":1532975726000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8389077\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/rait.2018.8389077","relation":{},"subject":[],"published":{"date-parts":[[2018,3]]}}}