{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:09:53Z","timestamp":1648688993150},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1993,9]]},"abstract":"<jats:p> We describe an alternative implementation of Atallah and Vishkin\u2019s parallel algorithm for finding an Euler Tour of a graph. Instead of finding a spanning tree as an intermediate step, this algorithm is based on identifying a strut which is easier to compute. Using the strut, vertices which have more than one circuit passing through them are identified directly. Stitching at such vertices reduces the number of circuits in the Euler Partition. <\/jats:p>","DOI":"10.1142\/s0129626493000265","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"223-231","source":"Crossref","is-referenced-by-count":5,"title":["ON FINDING EULER TOURS IN PARALLEL"],"prefix":"10.1142","volume":"03","author":[{"given":"EDSON N.","family":"CACERES","sequence":"first","affiliation":[{"name":"Center for Parallel Computation, Department of Computer Science, University of Central Florida, Orlando, Florida 32816, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"NARSINGH","family":"DEO","sequence":"additional","affiliation":[{"name":"Center for Parallel Computation, Department of Computer Science, University of Central Florida, Orlando, Florida 32816, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHIVAKUMAR","family":"SASTRY","sequence":"additional","affiliation":[{"name":"Center for Parallel Computation, Department of Computer Science, University of Central Florida, Orlando, Florida 32816, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JAYME L.","family":"SZWARCFITER","sequence":"additional","affiliation":[{"name":"NCE - COPPE, Universidade Federal do Rio de Janeiro, 20001 - Rio de Janeiro - R.J, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626493000265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:32:11Z","timestamp":1565184731000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626493000265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1993,9]]}},"alternative-id":["10.1142\/S0129626493000265"],"URL":"https:\/\/doi.org\/10.1142\/s0129626493000265","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}