%0 Journal Article %1 journals/disopt/KobayashiY12 %A Kobayashi, Yusuke %A Yin, Xin %D 2012 %J Discret. Optim. %K dblp %N 2 %P 98-108 %T An algorithm for finding a maximum t-matching excluding complete partite subgraphs. %U http://dblp.uni-trier.de/db/journals/disopt/disopt9.html#KobayashiY12 %V 9

@article{journals/disopt/KobayashiY12, added-at = {2021-02-12T00:00:00.000+0100}, author = {Kobayashi, Yusuke and Yin, Xin}, biburl = {https://www.bibsonomy.org/bibtex/233a9abe56385391f2042e8078c95b149/dblp}, ee = {https://doi.org/10.1016/j.disopt.2012.02.003}, interhash = {618d7043672584659e8ebf12c0314b1b}, intrahash = {33a9abe56385391f2042e8078c95b149}, journal = {Discret. Optim.}, keywords = {dblp}, number = 2, pages = {98-108}, timestamp = {2024-04-09T01:58:04.000+0200}, title = {An algorithm for finding a maximum t-matching excluding complete partite subgraphs.}, url = {http://dblp.uni-trier.de/db/journals/disopt/disopt9.html#KobayashiY12}, volume = 9, year = 2012 }