@article{2004b,
	author = {Fomin, Fedor V. and Matamala, Mart{\'{\i}}n and Rapaport, Ivan},
	coden = {JGTHDO},
	date-added = {2016-02-23 00:45:36 +0000},
	date-modified = {2016-02-23 00:45:36 +0000},
	doi = {10.1002/jgt.10160},
	fjournal = {Journal of Graph Theory},
	issn = {0364-9024},
	journal = {J. Graph Theory},
	mrclass = {05C12 (05C85 94C15)},
	mrnumber = {2039463 (2004k:05077)},
	mrreviewer = {K. B. Reid},
	number = {4},
	pages = {255--269},
	title = {Complexity of approximating the oriented diameter of chordal graphs},
	url = {http://dx.doi.org/10.1002/jgt.10160},
	url_paper = {http://www.ii.uib.no/~fomin/articles/2004/2004b.pdf},
	volume = {45},
	year = {2004},
	bdsk-url-1 = {http://dx.doi.org/10.1002/jgt.10160}}

{"_id":"J9do4gp4aL4vLQ87D","bibbaseid":"fomin-matamala-rapaport-complexityofapproximatingtheorienteddiameterofchordalgraphs-2004","downloads":0,"creationDate":"2015-06-23T17:42:40.136Z","title":"Complexity of approximating the oriented diameter of chordal graphs","author_short":["Fomin, F. V.","Matamala, M.","Rapaport, I."],"year":2004,"bibtype":"article","biburl":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Fomin"],"firstnames":["Fedor","V."],"suffixes":[]},{"propositions":[],"lastnames":["Matamala"],"firstnames":["Martín"],"suffixes":[]},{"propositions":[],"lastnames":["Rapaport"],"firstnames":["Ivan"],"suffixes":[]}],"coden":"JGTHDO","date-added":"2016-02-23 00:45:36 +0000","date-modified":"2016-02-23 00:45:36 +0000","doi":"10.1002/jgt.10160","fjournal":"Journal of Graph Theory","issn":"0364-9024","journal":"J. Graph Theory","mrclass":"05C12 (05C85 94C15)","mrnumber":"2039463 (2004k:05077)","mrreviewer":"K. B. Reid","number":"4","pages":"255–269","title":"Complexity of approximating the oriented diameter of chordal graphs","url":"http://dx.doi.org/10.1002/jgt.10160","url_paper":"http://www.ii.uib.no/~fomin/articles/2004/2004b.pdf","volume":"45","year":"2004","bdsk-url-1":"http://dx.doi.org/10.1002/jgt.10160","bibtex":"@article{2004b,\n\tauthor = {Fomin, Fedor V. and Matamala, Mart{\\'{\\i}}n and Rapaport, Ivan},\n\tcoden = {JGTHDO},\n\tdate-added = {2016-02-23 00:45:36 +0000},\n\tdate-modified = {2016-02-23 00:45:36 +0000},\n\tdoi = {10.1002/jgt.10160},\n\tfjournal = {Journal of Graph Theory},\n\tissn = {0364-9024},\n\tjournal = {J. Graph Theory},\n\tmrclass = {05C12 (05C85 94C15)},\n\tmrnumber = {2039463 (2004k:05077)},\n\tmrreviewer = {K. B. Reid},\n\tnumber = {4},\n\tpages = {255--269},\n\ttitle = {Complexity of approximating the oriented diameter of chordal graphs},\n\turl = {http://dx.doi.org/10.1002/jgt.10160},\n\turl_paper = {http://www.ii.uib.no/~fomin/articles/2004/2004b.pdf},\n\tvolume = {45},\n\tyear = {2004},\n\tbdsk-url-1 = {http://dx.doi.org/10.1002/jgt.10160}}\n\n","author_short":["Fomin, F. V.","Matamala, M.","Rapaport, I."],"key":"2004b","id":"2004b","bibbaseid":"fomin-matamala-rapaport-complexityofapproximatingtheorienteddiameterofchordalgraphs-2004","role":"author","urls":{"Paper":"http://dx.doi.org/10.1002/jgt.10160"," paper":"http://www.ii.uib.no/~fomin/articles/2004/2004b.pdf"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["complexity","approximating","oriented","diameter","chordal","graphs","fomin","matamala","rapaport"],"keywords":[],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j","RtxX8siCrYJoMBHxn"]}