Computing shortest paths and distances in planar graphs

dc.contributor.author	Djidjev, Hristo N.	en
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Ζαρολιάγκης, Χρήστος	el
dc.date.accessioned	2015-06-26T20:10:29Z
dc.date.available	2015-06-26T20:10:29Z
dc.date.issued	2015-06-26
dc.identifier.uri	http://hdl.handle.net/11400/19546
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://link.springer.com/chapter/10.1007%2F3-540-54233-7_145	en
dc.title	Computing shortest paths and distances in planar graphs	en
heal.type	conferenceItem
heal.classification	Επιστήμες
heal.classification	Πληροφορική
heal.classification	Science
heal.classification	Computer science
heal.classificationURI	N/A-Επιστήμες
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Science
heal.classificationURI	N/A-Computer science
heal.language	en
heal.access	campus
heal.fullTextAvailability	false
heal.conferenceName	Proceedings of the 18th International Colloquium	en
heal.conferenceItemType	full paper