Randomized OBDD-based graph algorithms
Saved in:
| Published in | Theoretical computer science Vol. 751; pp. 24 - 45 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
03.12.2018
|
| Online Access | Get full text |
| ISSN | 0304-3975 |
| DOI | 10.1016/j.tcs.2016.11.028 |
Cover
| Author | Bury, Marc |
|---|---|
| Author_xml | – sequence: 1 givenname: Marc surname: Bury fullname: Bury, Marc |
| BookMark | eNotzztvwjAUBWAPVCrQ_oBuTN2S3pvr-DG20JeEhITobDmJDYlIguws7a-vUXuWc6YjfQs2G8bBMfaAkCOgeOryqY55kWaOmEOhZmwOBDwjLctbtoixg5RSijl73NuhGfv2xzWr3ctmk1U2pnkM9nJa2fNxDO106uMdu_H2HN39fy_Z19vrYf2RbXfvn-vnbVYXQk6ZQ4-yAOlKq5WygpqiAo_kiCourfJacpJaiqYWJVHNeQXKctSe8wa9oyXDv986jDEG580ltL0N3wbBXHGmMwlnrjiDaBKOfgFAJEWU |
| Cites_doi | 10.1137/0222053 10.1007/s00453-007-9079-5 10.1016/0304-3975(88)90166-1 10.1016/j.tcs.2011.11.029 10.1016/0020-0190(96)00119-6 10.1137/S0097539701386216 10.1016/0022-0000(81)90033-7 10.1007/s00446-010-0121-5 10.1002/rsa.3240030308 10.1016/j.ic.2014.08.006 10.1016/0196-6774(86)90019-2 10.1109/43.298033 10.1137/0221015 10.1023/A:1008651924240 10.1016/0890-5401(92)90017-A 10.1006/jcss.1997.1545 10.1145/2049662.2049663 10.1002/rsa.3240060404 10.1137/0215074 10.1016/S0304-3975(02)00643-6 10.1137/1.9780898719789 10.1016/j.ipl.2013.05.002 10.1016/0020-0190(86)90144-4 10.1016/S0020-0190(03)00359-4 10.1214/aop/1176996762 10.1016/j.dam.2008.02.012 10.1016/S0022-0000(05)80069-8 10.1007/s10703-006-4341-z 10.1016/0885-064X(89)90015-0 10.1016/j.jda.2005.01.008 10.1016/j.tcs.2014.07.020 10.1109/TC.1986.1676819 10.1145/201019.201022 10.1142/S0129626493000022 10.1016/j.disc.2008.01.022 10.1109/12.324559 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2016.11.028 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EndPage | 45 |
| ExternalDocumentID | 10_1016_j_tcs_2016_11_028 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ XJT YNT ZMT ZY4 ~G- ~HD |
| ID | FETCH-LOGICAL-c267t-e1f17207e5a988a63d2b0f13e33b47a8f97437976dc6533c44b08a419f44d1fe3 |
| ISSN | 0304-3975 |
| IngestDate | Thu Oct 09 00:45:22 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c267t-e1f17207e5a988a63d2b0f13e33b47a8f97437976dc6533c44b08a419f44d1fe3 |
| PageCount | 22 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2016_11_028 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-12-03 |
| PublicationDateYYYYMMDD | 2018-12-03 |
| PublicationDate_xml | – month: 12 year: 2018 text: 2018-12-03 day: 03 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2018 |
| References | Awerbuch (10.1016/j.tcs.2016.11.028_br0060) 1989 Jukna (10.1016/j.tcs.2016.11.028_br0290) 1988; 57 Bollig (10.1016/j.tcs.2016.11.028_br0120) 2014; 239 Savický (10.1016/j.tcs.2016.11.028_br0440) 1995; 6 Bollig (10.1016/j.tcs.2016.11.028_br0080) 2012; 447 Naor (10.1016/j.tcs.2016.11.028_br0410) 1993; 22 Lai (10.1016/j.tcs.2016.11.028_br0320) 1994; 13 Sawitzki (10.1016/j.tcs.2016.11.028_br0460) 2006 Sawitzki (10.1016/j.tcs.2016.11.028_br0470) 2006 Sawitzki (10.1016/j.tcs.2016.11.028_br0450) 2004 Sawitzki (10.1016/j.tcs.2016.11.028_br0480) 2007; 14 Kabanets (10.1016/j.tcs.2016.11.028_br0300) 2003; 297 Burch (10.1016/j.tcs.2016.11.028_br0140) 1992; 98 Motwani (10.1016/j.tcs.2016.11.028_br0400) 1994; 49 Greenlaw (10.1016/j.tcs.2016.11.028_br0240) 1995 Sieling (10.1016/j.tcs.2016.11.028_br0500) 1993; 3 Israeli (10.1016/j.tcs.2016.11.028_br0270) 1986; 22 Luby (10.1016/j.tcs.2016.11.028_br0340) 1986; 15 Woelfel (10.1016/j.tcs.2016.11.028_br0550) 2006; 4 Gentilini (10.1016/j.tcs.2016.11.028_br0210) 2003 Nunkesser (10.1016/j.tcs.2016.11.028_br0430) 2009; 157 Masek (10.1016/j.tcs.2016.11.028_br0360) 1976 Wegener (10.1016/j.tcs.2016.11.028_br0520) 1994; 43 Alon (10.1016/j.tcs.2016.11.028_br0020) 1992; 3 Alon (10.1016/j.tcs.2016.11.028_br0050) 2008 Linial (10.1016/j.tcs.2016.11.028_br0330) 1992; 21 Siegel (10.1016/j.tcs.2016.11.028_br0490) 2004; 33 Negruseri (10.1016/j.tcs.2016.11.028_br0420) 2011; 16 Alon (10.1016/j.tcs.2016.11.028_br0010) 1986; 7 Bollig (10.1016/j.tcs.2016.11.028_br0090) 2013; 113 Karger (10.1016/j.tcs.2016.11.028_br0310) 1995; 42 Cormen (10.1016/j.tcs.2016.11.028_br0170) 2009 Hachtel (10.1016/j.tcs.2016.11.028_br0250) 1997; 10 Coudert (10.1016/j.tcs.2016.11.028_br0180) 1995 Wegener (10.1016/j.tcs.2016.11.028_br0530) 2000 Alon (10.1016/j.tcs.2016.11.028_br0030) 2003; 88 Gentilini (10.1016/j.tcs.2016.11.028_br0220) 2008; 50 Vazirani (10.1016/j.tcs.2016.11.028_br0510) 1986 Métivier (10.1016/j.tcs.2016.11.028_br0380) 2011; 23 Davis (10.1016/j.tcs.2016.11.028_br0190) 2011; 38 Mitzenmacher (10.1016/j.tcs.2016.11.028_br0390) 2005 Joffe (10.1016/j.tcs.2016.11.028_br0280) 1974; 2 Luby (10.1016/j.tcs.2016.11.028_br0350) 1993 Bollig (10.1016/j.tcs.2016.11.028_br0100) 2014; 560 Bryant (10.1016/j.tcs.2016.11.028_br0130) 1986; 35 Alon (10.1016/j.tcs.2016.11.028_br0040) 1999; 58 Bollig (10.1016/j.tcs.2016.11.028_br0110) 1996; 59 Meer (10.1016/j.tcs.2016.11.028_br0370) 2009; 309 Chor (10.1016/j.tcs.2016.11.028_br0150) 1989; 5 Bloem (10.1016/j.tcs.2016.11.028_br0070) 2006; 28 Hojati (10.1016/j.tcs.2016.11.028_br0260) 1992 Gillé (10.1016/j.tcs.2016.11.028_br0230) 2013 Christiani (10.1016/j.tcs.2016.11.028_br0160) 2014 Wegman (10.1016/j.tcs.2016.11.028_br0540) 1981; 22 |
| References_xml | – start-page: 364 year: 1989 ident: 10.1016/j.tcs.2016.11.028_br0060 article-title: Network decomposition and locality in distributed computation – year: 1986 ident: 10.1016/j.tcs.2016.11.028_br0510 – volume: 22 start-page: 838 year: 1993 ident: 10.1016/j.tcs.2016.11.028_br0410 article-title: Small-bias probability spaces: efficient constructions and applications publication-title: SIAM J. Comput. doi: 10.1137/0222053 – volume: 50 start-page: 120 year: 2008 ident: 10.1016/j.tcs.2016.11.028_br0220 article-title: Symbolic graphs: linear solutions to connectivity related problems publication-title: Algorithmica doi: 10.1007/s00453-007-9079-5 – start-page: 286 year: 2013 ident: 10.1016/j.tcs.2016.11.028_br0230 article-title: OBDD-based representation of interval graphs – volume: 57 start-page: 113 year: 1988 ident: 10.1016/j.tcs.2016.11.028_br0290 article-title: Entropy of contact circuits and lower bounds on their complexity publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(88)90166-1 – volume: 447 start-page: 2 year: 2012 ident: 10.1016/j.tcs.2016.11.028_br0080 article-title: On symbolic OBDD-based algorithms for the minimum spanning tree problem publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2011.11.029 – volume: 59 start-page: 233 year: 1996 ident: 10.1016/j.tcs.2016.11.028_br0110 article-title: On the effect of local changes in the variable ordering of ordered decision diagrams publication-title: Inform. Process. Lett. doi: 10.1016/0020-0190(96)00119-6 – volume: 33 start-page: 505 year: 2004 ident: 10.1016/j.tcs.2016.11.028_br0490 article-title: On universal classes of extremely random constant-time hash functions publication-title: SIAM J. Sci. Comput. doi: 10.1137/S0097539701386216 – volume: 22 start-page: 265 year: 1981 ident: 10.1016/j.tcs.2016.11.028_br0540 article-title: New hash functions and their use in authentication and set equality publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(81)90033-7 – volume: 23 start-page: 331 year: 2011 ident: 10.1016/j.tcs.2016.11.028_br0380 article-title: An optimal bit complexity randomized distributed MIS algorithm publication-title: Distrib. Comput. doi: 10.1007/s00446-010-0121-5 – volume: 3 start-page: 289 year: 1992 ident: 10.1016/j.tcs.2016.11.028_br0020 article-title: Simple construction of almost k-wise independent random variables publication-title: Random Structures Algorithms doi: 10.1002/rsa.3240030308 – volume: 239 start-page: 29 year: 2014 ident: 10.1016/j.tcs.2016.11.028_br0120 article-title: On efficient implicit OBDD-based algorithms for maximal matchings publication-title: Inform. and Comput. doi: 10.1016/j.ic.2014.08.006 – start-page: 781 year: 2006 ident: 10.1016/j.tcs.2016.11.028_br0470 article-title: Exponential lower bounds on the space complexity of OBDD-based graph algorithms – year: 2009 ident: 10.1016/j.tcs.2016.11.028_br0170 – start-page: 112 year: 1995 ident: 10.1016/j.tcs.2016.11.028_br0180 article-title: Doing two-level logic minimization 100 times faster – volume: 7 start-page: 567 year: 1986 ident: 10.1016/j.tcs.2016.11.028_br0010 article-title: A fast and simple randomized parallel algorithm for the maximal independent set problem publication-title: J. Algorithms doi: 10.1016/0196-6774(86)90019-2 – start-page: 813 year: 2008 ident: 10.1016/j.tcs.2016.11.028_br0050 article-title: k-wise independent random graphs – start-page: 196 year: 2014 ident: 10.1016/j.tcs.2016.11.028_br0160 article-title: Generating k-independent variables in constant time – volume: 13 start-page: 959 year: 1994 ident: 10.1016/j.tcs.2016.11.028_br0320 article-title: EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition publication-title: IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. doi: 10.1109/43.298033 – volume: 21 start-page: 193 year: 1992 ident: 10.1016/j.tcs.2016.11.028_br0330 article-title: Locality in distributed graph algorithms publication-title: SIAM J. Comput. doi: 10.1137/0221015 – volume: 10 start-page: 207 year: 1997 ident: 10.1016/j.tcs.2016.11.028_br0250 article-title: A symbolic algorithms for maximum flow in 0–1 networks publication-title: Form. Methods Syst. Des. doi: 10.1023/A:1008651924240 – volume: 98 start-page: 142 year: 1992 ident: 10.1016/j.tcs.2016.11.028_br0140 article-title: Symbolic model checking: 1020 states and beyond publication-title: Inform. and Comput. doi: 10.1016/0890-5401(92)90017-A – start-page: 471 year: 2006 ident: 10.1016/j.tcs.2016.11.028_br0460 article-title: The complexity of problems on implicitly represented inputs – volume: 58 start-page: 137 year: 1999 ident: 10.1016/j.tcs.2016.11.028_br0040 article-title: The space complexity of approximating the frequency moments publication-title: J. Comput. System Sci. doi: 10.1006/jcss.1997.1545 – volume: 38 start-page: 1:1 year: 2011 ident: 10.1016/j.tcs.2016.11.028_br0190 article-title: The University of Florida Sparse Matrix Collection publication-title: ACM Trans. Math. Software doi: 10.1145/2049662.2049663 – year: 1976 ident: 10.1016/j.tcs.2016.11.028_br0360 – start-page: 573 year: 2003 ident: 10.1016/j.tcs.2016.11.028_br0210 article-title: Computing strongly connected components in a linear number of symbolic steps – volume: 6 start-page: 407 year: 1995 ident: 10.1016/j.tcs.2016.11.028_br0440 article-title: Improved Boolean formulas for the Ramsey graphs publication-title: Random Structures Algorithms doi: 10.1002/rsa.3240060404 – start-page: 396 year: 1992 ident: 10.1016/j.tcs.2016.11.028_br0260 article-title: Efficient ω-regular language containment – volume: 15 start-page: 1036 year: 1986 ident: 10.1016/j.tcs.2016.11.028_br0340 article-title: A simple parallel algorithm for the maximal independent set problem publication-title: SIAM J. Comput. doi: 10.1137/0215074 – volume: 297 start-page: 281 year: 2003 ident: 10.1016/j.tcs.2016.11.028_br0300 article-title: Almost k-wise independence and hard Boolean functions publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(02)00643-6 – volume: 14 year: 2007 ident: 10.1016/j.tcs.2016.11.028_br0480 article-title: Implicit simulation of FNC algorithms publication-title: Electron. Colloq. Comput. Complex. – year: 2000 ident: 10.1016/j.tcs.2016.11.028_br0530 article-title: Branching Programs and Binary Decision Diagrams doi: 10.1137/1.9780898719789 – volume: 113 start-page: 584 year: 2013 ident: 10.1016/j.tcs.2016.11.028_br0090 article-title: Priority functions for the approximation of the metric TSP publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2013.05.002 – volume: 16 year: 2011 ident: 10.1016/j.tcs.2016.11.028_br0420 article-title: Solving maximum flow problems on real world bipartite graphs publication-title: ACM J. Exp. Algorithmics – start-page: 301 year: 2004 ident: 10.1016/j.tcs.2016.11.028_br0450 article-title: Implicit flow maximization by iterative squaring – volume: 22 start-page: 77 year: 1986 ident: 10.1016/j.tcs.2016.11.028_br0270 article-title: A fast and simple randomized parallel algorithm for maximal matching publication-title: Inform. Process. Lett. doi: 10.1016/0020-0190(86)90144-4 – volume: 88 start-page: 107 year: 2003 ident: 10.1016/j.tcs.2016.11.028_br0030 article-title: Almost k-wise independence versus k-wise independence publication-title: Inform. Process. Lett. doi: 10.1016/S0020-0190(03)00359-4 – volume: 2 start-page: 161 year: 1974 ident: 10.1016/j.tcs.2016.11.028_br0280 article-title: On a set of almost deterministic k-independent random variables publication-title: Ann. Probab. doi: 10.1214/aop/1176996762 – volume: 157 start-page: 247 year: 2009 ident: 10.1016/j.tcs.2016.11.028_br0430 article-title: Representation of graphs by OBDDs publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2008.02.012 – volume: 49 start-page: 478 year: 1994 ident: 10.1016/j.tcs.2016.11.028_br0400 article-title: The probabilistic method yields deterministic parallel algorithms publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(05)80069-8 – volume: 28 start-page: 37 year: 2006 ident: 10.1016/j.tcs.2016.11.028_br0070 article-title: An algorithm for strongly connected component analysis in nlogn symbolic steps publication-title: Form. Methods Syst. Des. doi: 10.1007/s10703-006-4341-z – volume: 5 start-page: 96 year: 1989 ident: 10.1016/j.tcs.2016.11.028_br0150 article-title: On the power of two-point based sampling publication-title: J. Complexity doi: 10.1016/0885-064X(89)90015-0 – volume: 4 start-page: 51 year: 2006 ident: 10.1016/j.tcs.2016.11.028_br0550 article-title: Symbolic topological sorting with OBDDs publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2005.01.008 – year: 2005 ident: 10.1016/j.tcs.2016.11.028_br0390 – volume: 560 start-page: 131 year: 2014 ident: 10.1016/j.tcs.2016.11.028_br0100 article-title: Implicit computation of maximum bipartite matchings by sublinear functional operations publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2014.07.020 – volume: 35 start-page: 677 year: 1986 ident: 10.1016/j.tcs.2016.11.028_br0130 article-title: Graph-based algorithms for Boolean function manipulation publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1986.1676819 – volume: 42 start-page: 321 year: 1995 ident: 10.1016/j.tcs.2016.11.028_br0310 article-title: A randomized linear-time algorithm to find minimum spanning trees publication-title: J. ACM doi: 10.1145/201019.201022 – volume: 3 start-page: 3 year: 1993 ident: 10.1016/j.tcs.2016.11.028_br0500 article-title: NC-algorithms for operations on binary decision diagrams publication-title: Parallel Process. Lett. doi: 10.1142/S0129626493000022 – year: 1995 ident: 10.1016/j.tcs.2016.11.028_br0240 – volume: 309 start-page: 843 year: 2009 ident: 10.1016/j.tcs.2016.11.028_br0370 article-title: On the OBDD size for graphs of bounded tree- and clique-width publication-title: Discrete Math. doi: 10.1016/j.disc.2008.01.022 – volume: 43 start-page: 1262 year: 1994 ident: 10.1016/j.tcs.2016.11.028_br0520 article-title: The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions publication-title: IEEE Trans. Comput. doi: 10.1109/12.324559 – year: 1993 ident: 10.1016/j.tcs.2016.11.028_br0350 |
| SSID | ssj0000576 |
| Score | 2.2371864 |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 24 |
| Title | Randomized OBDD-based graph algorithms |
| Volume | 751 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) issn: 0304-3975 databaseCode: GBLVA dateStart: 20110101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000576 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier Free Content issn: 0304-3975 databaseCode: IXB dateStart: 19750601 customDbUrl: isFulltext: true dateEnd: 20211102 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000576 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect (LAB) issn: 0304-3975 databaseCode: ACRLP dateStart: 19950109 customDbUrl: isFulltext: true dateEnd: 20211012 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000576 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] issn: 0304-3975 databaseCode: AIKHN dateStart: 19950109 customDbUrl: isFulltext: true dateEnd: 20211012 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000576 providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) issn: 0304-3975 databaseCode: .~1 dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000576 providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals issn: 0304-3975 databaseCode: AKRWK dateStart: 19750601 customDbUrl: isFulltext: true mediaType: online dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000576 providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA66XvTgY1V804N4cGnpI9ukR3WVRVgF2YW9lTRJ1aJd0XrZg7_dSZs-XBVcL6WUEtp-6cw3ycw3CB0riT3mEmmCPxUmphibkSNUuxefECIFDbhahxzc-P0Rvh53x3V3z7y6JIssPv2xruQ_qMI1wFVVyc6BbDUoXIBzwBeOgDAc_4TxHUvF5PlxCqTx9rzXM5VLEp1cg7rDnu4nEPg_aDXypJoVVd0i1w0dOtoLVpG53lofwD_QXBRwaJ5g4TVsh6c2PIKiKUlp6IiWdtWmCjecXiHp-M2cFpF9YmVcKZs7vqUET3Ux9xfp6hmXUiX6lTlkSQhDhGoICDlCGGIRLblgh1WzDeujTsoB9ljsLuvHL_eh84y8madoMIkGJRiuo1XN5Y2zApgNtCDTNlor-2QY2my20cqg0sZ920QnNWpGjZqRo2bUqG2h0dXl8KJv6m4VJod5nZnSiYEM2kR2WUAp8z3hRnasFpm9CBNGY4jcPALsT3AfODbHOLIpw04QYyycWHrbqJVOUrmDDBaLAMI46THBMRWUBl2XEWBmDE4cm-2i0_LNw5dClCT89UvvzXPzPlqup9MBamWv7_IQWFcWHeVAfQJg8Cjh |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Randomized+OBDD-based+graph+algorithms&rft.jtitle=Theoretical+computer+science&rft.au=Bury%2C+Marc&rft.date=2018-12-03&rft.issn=0304-3975&rft.volume=751&rft.spage=24&rft.epage=45&rft_id=info:doi/10.1016%2Fj.tcs.2016.11.028&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2016_11_028 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |