Testing the diameter of graphs

@article{citeulike:2156904, address = {New York, NY, USA}, author = {Parnas, Michal and Ron, Dana }, citeulike-article-id = {2156904}, doi = {10.1002/rsa.10013}, doi = {10.1002/rsa.10013.abs}, issn = {1042-9832}, journal = {Random Struct. Algorithms}, keywords = {algorithms, graph, testing}, month = {March}, number = {2}, pages = {165--183}, posted-at = {2007-12-21 20:39:40}, priority = {2}, publisher = {John Wiley \& Sons, Inc.}, title = {Testing the diameter of graphs}, url = {http://portal.acm.org/citation.cfm?id=605715}, volume = {20}, year = {2002} }

TY - JOUR ID - citeulike:2156904 L3 - citeulike-article-id:2156904 TI - Testing the diameter of graphs JF - Random Struct. Algorithms VL - 20 IS - 2 SP - 165 EP - 183 AD - New York, NY, USA PB - John Wiley \& Sons, Inc. SN - 1042-9832 KW - algorithms KW - graph KW - testing AU - Parnas, Michal AU - Ron, Dana PY - 2002/03// UR - http://portal.acm.org/citation.cfm?id=605715 ER -