%0 Journal Article %1 journals/networks/MasudaNKF90 %A Masuda, Sumio %A Nakajima, Kazuo %A Kashiwabara, Toshinobu %A Fujisawa, Toshio %D 1990 %J Networks %K dblp %N 2 %P 157-171 %T Efficient algorithms for finding maximum cliques of an overlap graph. %U http://dblp.uni-trier.de/db/journals/networks/networks20.html#MasudaNKF90 %V 20

@article{journals/networks/MasudaNKF90, added-at = {2013-01-24T00:00:00.000+0100}, author = {Masuda, Sumio and Nakajima, Kazuo and Kashiwabara, Toshinobu and Fujisawa, Toshio}, biburl = {https://www.bibsonomy.org/bibtex/20859b9d3da563fe40f87ccaebc39b266/dblp}, ee = {http://dx.doi.org/10.1002/net.3230200203}, interhash = {59a80f24614517db9682870f0d295cd7}, intrahash = {0859b9d3da563fe40f87ccaebc39b266}, journal = {Networks}, keywords = {dblp}, number = 2, pages = {157-171}, timestamp = {2013-01-25T11:33:51.000+0100}, title = {Efficient algorithms for finding maximum cliques of an overlap graph.}, url = {http://dblp.uni-trier.de/db/journals/networks/networks20.html#MasudaNKF90}, volume = 20, year = 1990 }