I/O-Efficient Planar Separators
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph $G$ with $N$ vertices and an integer $r > 0$, a vertex separator of size O$(N / \sqrt{r})$ that partitions $G$ into O$(N / r)$ subgraphs of size at mos...
Gespeichert in:
| Veröffentlicht in: | SIAM journal on computing Jg. 38; H. 3; S. 767 - 801 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Philadelphia
Society for Industrial and Applied Mathematics
01.01.2008
|
| Schlagworte: | |
| ISSN: | 0097-5397, 1095-7111 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph $G$ with $N$ vertices and an integer $r > 0$, a vertex separator of size O$(N / \sqrt{r})$ that partitions $G$ into O$(N / r)$ subgraphs of size at most $r$ and boundary size O$(\sqrt{r})$ can be computed in O$(\operatorname{sort}(N))$ I/Os. This bound holds provided that $M \ge 56r \log^2 B$. Together with an I/O-efficient planar embedding algorithm presented in [N. Zeh, I/O-Efficient Algorithms for Shortest Path Related Problems, Ph.D. thesis, School of Computer Science, Carleton University, Ottawa, ON, Canada, 2002], this result is the basis for I/O-efficient solutions to many other fundamental problems on planar graphs, including breadth-first search and shortest paths [L. Arge, G. S. Brodal, and L. Toma, J. Algorithms, 53 (2004), pp. 186-206; L. Arge, L. Toma, and N. Zeh, I/O-efficient algorithms for planar digraphs, in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2003, pp. 85-93], depth-first search [L. Arge et al., J. Graph Algorithms Appl., 7 (2003), pp. 105-129; L. Arge and N. Zeh, I/O-efficient strong connectivity and depth-first search for directed planar graphs, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 2003, pp. 261-270], strong connectivity [L. Arge and N. Zeh, I/O-efficient strong connectivity and depth-first search for directed planar graphs, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 2003, pp. 261-270], and topological sorting [L. Arge and L. Toma, Simplified external memory algorithms for planar DAGs, in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 3111, Springer-Verlag, Berlin, New York, 2004, pp. 493-503; L. Arge, L. Toma, and N. Zeh, I/O-efficient algorithms for planar digraphs, in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2003, pp. 85-93]. Our second result shows that, given I/O-efficient solutions to these problems, a general separator algorithm for graphs with costs and weights on their vertices [L. Aleksandrov et al., Partitioning planar graphs with costs and weights, in Proceedings of the 4th Workshop on Algorithm Engineering and Experiments, Lecture Notes in Comput. Sci. 2409, Springer-Verlag, Berlin, New York, 2002, pp. 98-107] can be made I/O-efficient. Many classical separator theorems are special cases of this result. In particular, our I/O-efficient version allows the computation of a separator as produced by our first separator algorithm, but without placing any constraints on $r$ in relation to the memory size. |
|---|---|
| AbstractList | We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph $G$ with $N$ vertices and an integer $r > 0$, a vertex separator of size O$(N / \sqrt{r})$ that partitions $G$ into O$(N / r)$ subgraphs of size at most $r$ and boundary size O$(\sqrt{r})$ can be computed in O$(\operatorname{sort}(N))$ I/Os. This bound holds provided that $M \ge 56r \log^2 B$. Together with an I/O-efficient planar embedding algorithm presented in [N. Zeh, I/O-Efficient Algorithms for Shortest Path Related Problems, Ph.D. thesis, School of Computer Science, Carleton University, Ottawa, ON, Canada, 2002], this result is the basis for I/O-efficient solutions to many other fundamental problems on planar graphs, including breadth-first search and shortest paths [L. Arge, G. S. Brodal, and L. Toma, J. Algorithms, 53 (2004), pp. 186-206; L. Arge, L. Toma, and N. Zeh, I/O-efficient algorithms for planar digraphs, in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2003, pp. 85-93], depth-first search [L. Arge et al., J. Graph Algorithms Appl., 7 (2003), pp. 105-129; L. Arge and N. Zeh, I/O-efficient strong connectivity and depth-first search for directed planar graphs, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 2003, pp. 261-270], strong connectivity [L. Arge and N. Zeh, I/O-efficient strong connectivity and depth-first search for directed planar graphs, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 2003, pp. 261-270], and topological sorting [L. Arge and L. Toma, Simplified external memory algorithms for planar DAGs, in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 3111, Springer-Verlag, Berlin, New York, 2004, pp. 493-503; L. Arge, L. Toma, and N. Zeh, I/O-efficient algorithms for planar digraphs, in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2003, pp. 85-93]. Our second result shows that, given I/O-efficient solutions to these problems, a general separator algorithm for graphs with costs and weights on their vertices [L. Aleksandrov et al., Partitioning planar graphs with costs and weights, in Proceedings of the 4th Workshop on Algorithm Engineering and Experiments, Lecture Notes in Comput. Sci. 2409, Springer-Verlag, Berlin, New York, 2002, pp. 98-107] can be made I/O-efficient. Many classical separator theorems are special cases of this result. In particular, our I/O-efficient version allows the computation of a separator as produced by our first separator algorithm, but without placing any constraints on $r$ in relation to the memory size. |
| Author | Zeh, Norbert Maheshwari, Anil |
| Author_xml | – sequence: 1 givenname: Anil surname: Maheshwari fullname: Maheshwari, Anil – sequence: 2 givenname: Norbert surname: Zeh fullname: Zeh, Norbert |
| BookMark | eNp9kEtLAzEUhYNUcFr9Aa4s7mNz82iSpZSqhUKF6jpk8oAp48yYpAv_vVPqSsHVXZzznXM5UzTp-i4gdAvkAYDJxZ4QLQXTkgjOl5qKC1QB0QJLAJig6iTjk36FpjkfCAHOgVXobrPY4XWMjWtCV-avre1smu_DYJMtfcrX6DLaNoebnztD70_rt9UL3u6eN6vHLXZU0oK9D1bQsc8z7wKjUSlQNXhlrXM1UdL6yIMgAqhiToOUuuZKeTE-rYBTNkP359wh9Z_HkIs59MfUjZVGg1pyAQRGkzybXOpzTiEa1xRbmr4ryTatAWJOY5g_Y4wk_CKH1HzY9PUP8w1N3l_O |
| CitedBy_id | crossref_primary_10_1007_s00453_018_0518_2 crossref_primary_10_1145_3418356 crossref_primary_10_1145_2133803_2330083 |
| Cites_doi | 10.1007/PL00009250 10.1016/0196-6774(84)90019-1 10.7155/jgaa.00063 10.1016/S0166-218X(02)00217-2 10.1007/s004530010031 10.1016/0022-0000(86)90030-9 10.1007/s00453-003-1021-x 10.1137/0216064 10.1145/384192.384193 10.1016/S0022-0000(76)80045-1 10.1145/321850.321852 10.1016/S1389-1286(00)00083-9 10.1016/0304-3975(76)90086-4 10.1137/S0895480194272183 10.1006/jagm.1993.1013 10.1006/jcss.1995.1076 10.1016/j.jalgor.2004.04.001 10.1137/0136016 |
| ContentType | Journal Article |
| Copyright | [Copyright] © 2008 Society for Industrial and Applied Mathematics |
| Copyright_xml | – notice: [Copyright] © 2008 Society for Industrial and Applied Mathematics |
| DBID | AAYXX CITATION 3V. 7RQ 7WY 7WZ 7X2 7XB 87Z 88A 88F 88I 88K 8AL 8FE 8FG 8FH 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI CCPQU D1I DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- KB. L.- L6V LK8 M0C M0K M0N M1Q M2O M2P M2T M7P M7S MBDVC P5Z P62 PATMY PDBOC PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYCSY Q9U S0W U9A |
| DOI | 10.1137/S0097539705446925 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Career & Technical Education Database ABI-INFORM Complete ABI/INFORM Global (PDF only) Agricultural Science Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Biology Database (Alumni Edition) Military Database (Alumni Edition) Science Database (Alumni Edition) Telecommunications (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection Agricultural & Environmental Science Collection ProQuest Central Essentials - QC Biological Science Collection ProQuest Central Business Premium Collection ProQuest Technology Collection Natural Science Collection ProQuest One ProQuest Materials Science Collection ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Materials Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Biological Science Collection ABI/INFORM Global Agricultural Science Database Computing Database Military Database Research Library Science Database Telecommunications Database Biological Science Database Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Environmental Science Database Materials Science Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection Environmental Science Collection ProQuest Central Basic DELNET Engineering & Technology Collection |
| DatabaseTitle | CrossRef Agricultural Science Database ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest Telecommunications ProQuest One Applied & Life Sciences Natural Science Collection Biological Science Collection ProQuest Central (New) Engineering Collection Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest One Academic Eastern Edition Agricultural Science Collection ProQuest Technology Collection ProQuest Telecommunications (Alumni Edition) Biological Science Database ProQuest Business Collection Environmental Science Collection ProQuest Career and Technical Education ProQuest One Academic UKI Edition Environmental Science Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) Materials Science Collection ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Natural Science Collection ProQuest Biology Journals (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Agricultural & Environmental Science Collection Materials Science Database ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Materials Science Collection ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest DELNET Engineering and Technology Collection Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Agricultural Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1095-7111 |
| EndPage | 801 |
| ExternalDocumentID | 2573591461 10_1137_S0097539705446925 |
| GroupedDBID | --Z -DZ -~X .4S .DC 123 4.4 7RQ 7WY 7X2 7XC 88I 8CJ 8FE 8FG 8FH 8FL 8G5 8V8 AALVN AASXH AAYXX ABDBF ABDPE ABJCF ABKAD ABMZU ABPPZ ABUFD ABUWG ACBEA ACGFO ACGOD ACIWK ACNCT ACPRK ACUHS ADBBV ADMHC ADXHL AEMOZ AENEX AFFHD AFKRA AFRAH AHQJS AKVCP ALMA_UNASSIGNED_HOLDINGS ANXRF ARAPS ARCSS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI BPHCQ CCPQU CITATION CS3 CZ9 D1I D1J D1K DQ2 DU5 DWQXO EAP EAS EBR EBS EBU ECS EDO EJD EMK EST ESX FRNLG GNUQQ GUQSH H13 HCIFZ H~9 I-F K1G K6- K60 K6V K6~ K7- KB. KC. L6V LK5 LK8 M0C M0K M1Q M2O M2P M7P M7R M7S MK~ NHB OHT P1Q P2P P62 PATMY PDBOC PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PTHSS PYCSY RJG RNS RSI S0W TAE TH9 TN5 TUS TWZ UHB UQL VOH WH7 WHG XJE YNT YYP YZZ ZCG ZY4 3V. 7XB 88A 88K 8AL 8FK JQ2 L.- M0N M2T MBDVC PKEHL PQEST PQUKI PRINS Q9U U9A |
| ID | FETCH-LOGICAL-c272t-ddea52095d3dce32f8818b1d8aaccb087adf4e5051283c91779b488d597581423 |
| IEDL.DBID | M2P |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258895100002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0097-5397 |
| IngestDate | Thu Nov 06 13:32:23 EST 2025 Tue Nov 18 21:18:51 EST 2025 Sat Nov 29 03:54:34 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c272t-ddea52095d3dce32f8818b1d8aaccb087adf4e5051283c91779b488d597581423 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| PQID | 918645101 |
| PQPubID | 666313 |
| PageCount | 35 |
| ParticipantIDs | proquest_journals_918645101 crossref_citationtrail_10_1137_S0097539705446925 crossref_primary_10_1137_S0097539705446925 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-01-00 20080101 |
| PublicationDateYYYYMMDD | 2008-01-01 |
| PublicationDate_xml | – month: 01 year: 2008 text: 2008-01-00 |
| PublicationDecade | 2000 |
| PublicationPlace | Philadelphia |
| PublicationPlace_xml | – name: Philadelphia |
| PublicationTitle | SIAM journal on computing |
| PublicationYear | 2008 |
| Publisher | Society for Industrial and Applied Mathematics |
| Publisher_xml | – name: Society for Industrial and Applied Mathematics |
| References | R2 R4 R5 R6 R10 R21 R32 R12 R22 R25 R24 R16 R27 R15 R18 R29 R17 R19 |
| References_xml | – ident: R17 doi: 10.1007/PL00009250 – ident: R21 doi: 10.1016/0196-6774(84)90019-1 – ident: R6 doi: 10.7155/jgaa.00063 – ident: R25 doi: 10.1016/S0166-218X(02)00217-2 – ident: R16 doi: 10.1007/s004530010031 – ident: R29 doi: 10.1016/0022-0000(86)90030-9 – ident: R4 doi: 10.1007/s00453-003-1021-x – ident: R19 doi: 10.1137/0216064 – ident: R32 doi: 10.1145/384192.384193 – ident: R10 doi: 10.1016/S0022-0000(76)80045-1 – ident: R24 doi: 10.1145/321850.321852 – ident: R12 doi: 10.1016/S1389-1286(00)00083-9 – ident: R18 doi: 10.1016/0304-3975(76)90086-4 – ident: R2 doi: 10.1137/S0895480194272183 – ident: R15 doi: 10.1006/jagm.1993.1013 – ident: R22 doi: 10.1006/jcss.1995.1076 – ident: R5 doi: 10.1016/j.jalgor.2004.04.001 – ident: R27 doi: 10.1137/0136016 |
| SSID | ssj0014413 |
| Score | 1.864381 |
| Snippet | We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph $G$ with $N$... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 767 |
| SubjectTerms | Algorithms Computer science Connectivity Geographic information systems Graphs |
| Title | I/O-Efficient Planar Separators |
| URI | https://www.proquest.com/docview/918645101 |
| Volume | 38 |
| WOSCitedRecordID | wos000258895100002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7WY dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0C dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: P5Z dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Agricultural Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0K dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/agriculturejournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7P dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Career & Technical Education Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7RQ dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: K7- dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7S dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Environmental Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: PATMY dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/environmentalscience providerName: ProQuest – providerCode: PRVPQU databaseName: Materials Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: KB. dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/materialsscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Military Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M1Q dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: BENPR dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2O dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2P dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PT9swFH6CwmE7DMaGgI7SAyckj9hO6uSEALUCdW0D67Rul8ixHQlpaqHp9vfvPdetNiFx4fIpURwpeonfD_vl-wBOOx3bqTBPZZWVJYurSjAtZMIcd2nGbZmY0r_pL2o4TCeTLA-9OXVoq1z5RO-o7czQGvl5xtNOTB_QxeMTI9Eo2lwNChqbsIWJDaeOroHI15sIGOkDCaViCcbdsKnJJTFGR_RHaaYwY8ECkYSy_w1L_3tlH2p6O698yF14F3LM9uXyo3gPG266Bzsr_YZ2mM578Haw5mytP8DJ7fmIdT2jBAaiNqkZaRzsPDn4bF5_hG-97vj6hgX5BGaEEguGjktTk0tipTVOiirF4Fxym2ptTBmlStsqdpgBYYiSBss2lZU4nS2WGEnKMc3ah8Z0NnUH0Oa6NJUQlYtsEmMJlKJv0lksLRZASkt1CNHKeoUJ3OIkcfGr8DWGVMUzgx_C2fqWxyWxxkuDmyt7F2GO1cXa2EcvXm3Cm2WPBy2bfILGYv7bHcO2-bN4qOct2FT3d4Tff7Rg66o7zO_xrK8Y4dVnxEF07bFPyGnsQIw85h7HhMofq6-IefLzL3qI0EY |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NS8NAEB2KCurBalX8Nge9CIvJbpJNDiKiLS221UOF3uJmdwOCtLWpij_K_-hsvlAEbz14TTYQMpM3Mzuz7wGc-L7yE8xTSaJYTNwkoURQ5hHt6CB0VOzJOLN0l_f7wXAY3tfgszwLY8YqS0zMgFqNpdkjPw-dwHeNA11OXogRjTLN1VJBI_eKW_3xjhVbetG5QfOeUtpqDq7bpBAVIJJyOiP4Owsz-uEppqRmNAkwZMWOCoSQMrYDLlTiaswLELiZxGKGhzE6ucLE2wsc1_AcIOIvYhZB7WxS8L5qWuC1gvSSEw_jfNFEdZhhqLbNCdaQY4aEBakR5v4eBn9GgSy0ter_7KOsw1qRQ1tXudNvQE2PGlAv9SmsAq4asNqrOGnTTTjunN-RZsaYgYHWMmpNAhfrjPx8PE234GEuL70NC6PxSO-A5YhYJpQm2laeiyVegNgrQpcpLPC4YHwX7NJakSy4042Ex3OU1VCMR78MvAtn1SOTnDjkr8X7pX2jAkPSqDLu3p93j2G5Peh1o26nf7sPK_k8i9kiOoCF2fRVH8KSfJs9pdOjzFsteJy3J3wBM5YfvQ |
| 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=I%2FO-Efficient+Planar+Separators&rft.jtitle=SIAM+journal+on+computing&rft.au=Maheshwari%2C+Anil&rft.au=Zeh%2C+Norbert&rft.date=2008-01-01&rft.issn=0097-5397&rft.eissn=1095-7111&rft.volume=38&rft.issue=3&rft.spage=767&rft.epage=801&rft_id=info:doi/10.1137%2FS0097539705446925&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_S0097539705446925 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0097-5397&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0097-5397&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0097-5397&client=summon |