%0 Conference Paper %1 conf/ictcsdm/PandaP16 %A Panda, B. S. %A Pandey, Arti %B ICTCSDM %D 2016 %E Arumugam, S. %E Bagga, Jay S. %E Beineke, Lowell W. %E Panda, B. S. %I Springer %K dblp %P 218-227 %T On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. %U http://dblp.uni-trier.de/db/conf/ictcsdm/ictcsdm2016.html#PandaP16 %V 10398 %@ 978-3-319-64419-6

@inproceedings{conf/ictcsdm/PandaP16, added-at = {2021-06-09T00:00:00.000+0200}, author = {Panda, B. S. and Pandey, Arti}, biburl = {https://www.bibsonomy.org/bibtex/2959397a255e7f5f85d511962bc4bd361/dblp}, booktitle = {ICTCSDM}, crossref = {conf/ictcsdm/2016}, editor = {Arumugam, S. and Bagga, Jay S. and Beineke, Lowell W. and Panda, B. S.}, ee = {https://doi.org/10.1007/978-3-319-64419-6_29}, interhash = {c17c7bf238ea2e25b71315ab60bed29c}, intrahash = {959397a255e7f5f85d511962bc4bd361}, isbn = {978-3-319-64419-6}, keywords = {dblp}, pages = {218-227}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T15:34:55.000+0200}, title = {On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.}, url = {http://dblp.uni-trier.de/db/conf/ictcsdm/ictcsdm2016.html#PandaP16}, volume = 10398, year = 2016 }