Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)
Marcus Peinado, Thomas Lengauer · 1998
Article Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract) Share on Authors: Marcus Peinado Institute for Algorithms and Scientific Computing, German National Research Center for Information Technology (GMD), 53754 Sankt Augustin, Germany and Internationl Computer Science Institute, Berkeley, California Institute for Algorithms and Scientific Computing, German National Research Center for Information Technology (GMD), 53754 Sankt Augustin, Germany and Internationl Computer Science Institute, Berkeley, CaliforniaView Profile , Thomas Lengauer Institute for Algorithms and Scientific Computing, German National Research Center for Information Technology (GMD), 53754 Sankt Augustin, Germany Institute for Algorithms and Scientific Computing, German National Research Center for Information Technology (GMD), 53754 Sankt Augustin, GermanyView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 176–185https://doi.org/10.1145/276698.276729Online:23 May 1998Publication History 1citation235DownloadsMetricsTotal Citations1Total Downloads235Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access