{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:46:20Z","timestamp":1744051580211},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5768,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0166-218x(97)00007-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"1-16","source":"Crossref","is-referenced-by-count":17,"title":["Efficient computation of implicit representations of sparse graphs"],"prefix":"10.1016","volume":"78","author":[{"given":"Srinivasa R.","family":"Arikati","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00007-3_BIB1","first-page":"67","article-title":"Minimum partition of a matroid into independent sets","author":"Edmonds","year":"1965","journal-title":"Res. NBS 69B"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB2","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with applications to optimal parallel list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Inform and Control"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB3","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Inform and Comput."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB4","series-title":"Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA'92)","first-page":"410","article-title":"Parallel algorithms for straight-line grid embeddings of planar graphs","author":"F\u00fcrer","year":"1992"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB5","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01758774","article-title":"Forests, frames, and games: algorithms for matroid sums and applications","volume":"7","author":"Gabow","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB6","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0401044","article-title":"Parallel symmetry-breaking in sparse graphs","volume":"1","author":"Goldberg","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0890-5401(90)90034-F","article-title":"Optimal parallel algorithms on planar graphs","volume":"84","author":"Hagerup","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB8","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1137\/0218020","article-title":"Optimal parallel 5-colouring of planar graphs","volume":"18","author":"Hagerup","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207728108963728","article-title":"Use of matroid theory in operating research, circuits and systems theory","volume":"12","author":"Iri","year":"1981","journal-title":"Int. J. Systems Sci."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB10","series-title":"Proceedings of the 25th IEEE Symposium on FOCS","first-page":"137","article-title":"The multi-tree approach to reliability in distributed networks","author":"Itai","year":"1984"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB11","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1j\u00e1","year":"1992"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB12","series-title":"Proceedings of the 20th ACM Symposium on Theory of Computing (STOC'88)","first-page":"334","article-title":"Implicit representation of graphs","author":"Kannan","year":"1988"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0603009","article-title":"On generic rigidity in the plane","volume":"3","author":"Lovasz","year":"1982","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB14","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0405004","article-title":"Computing edge-connectivity in multigraphs and capacitated graphs","volume":"5","author":"Nagamochi","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB15","series-title":"Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA'92)","first-page":"357","article-title":"Randomized parallel algorithms for matroid union and intersection, with applications to arborescences, and edge-disjoint spanning trees","author":"Narayanan","year":"1992"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB17","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decomposition of finite graphs into forests","volume":"39","author":"Nash-Williams","year":"1964","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(97)00007-3_BIB18","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TCT.1970.1083186","article-title":"Topological degrees of freedom and mixed analysis of electrical networks","author":"Ohtsuki","year":"1970","journal-title":"IEEE Trans. Circuit Theory CT-17"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB19","series-title":"Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA'90)","first-page":"138","article-title":"Embedding planar graphs on the grid","author":"Schnyder","year":"1990"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB20","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/202840.202845","article-title":"Two recent algorithms for the global minimum cut problem","volume":"26","author":"Subramanian","year":"1995","journal-title":"SIGACT News"},{"key":"10.1016\/S0166-218X(97)00007-3_BIB21","first-page":"525","article-title":"Graph algorithms","volume":"Vol. A","author":"van Leeuwen","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000073?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000073?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:46Z","timestamp":1556666806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0166218X97000073"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00007-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}