Measuring the similarity of geometric graphs

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 320
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCheong, Otfried-
dc.contributor.authorGudmundsson, Joachim-
dc.contributor.authorKim, Hyo-Sil-
dc.contributor.authorSchymura, Daria-
dc.contributor.authorStehn, Fabian-
dc.date.accessioned2013-03-19T01:34:27Z-
dc.date.available2013-03-19T01:34:27Z-
dc.date.created2012-02-06-
dc.date.issued2009-06-04-
dc.identifier.citation8th International Symposium on Experimental Algorithms, SEA 2009, v., no., pp.101 - 112-
dc.identifier.urihttp://hdl.handle.net/10203/154524-
dc.languageENG-
dc.titleMeasuring the similarity of geometric graphs-
dc.typeConference-
dc.identifier.scopusid2-s2.0-68749101000-
dc.type.rimsCONF-
dc.citation.beginningpage101-
dc.citation.endingpage112-
dc.citation.publicationname8th International Symposium on Experimental Algorithms, SEA 2009-
dc.identifier.conferencecountryGermany-
dc.identifier.conferencecountryGermany-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorGudmundsson, Joachim-
dc.contributor.nonIdAuthorKim, Hyo-Sil-
dc.contributor.nonIdAuthorSchymura, Daria-
dc.contributor.nonIdAuthorStehn, Fabian-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0