A V log V algorithm for isomorphism of triconnected planar graphs
An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a constant times | V| log | V| where | V| is the number of vertices in the graphs.
Saved in:
| Published in | Journal of computer and system sciences Vol. 7; no. 3; pp. 323 - 331 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
1973
|
| Online Access | Get full text |
| ISSN | 0022-0000 1090-2724 |
| DOI | 10.1016/S0022-0000(73)80013-3 |
Cover
| Abstract | An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a constant times |
V| log |
V| where |
V| is the number of vertices in the graphs. |
|---|---|
| AbstractList | An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a constant times |
V| log |
V| where |
V| is the number of vertices in the graphs. |
| Author | Hopcroft, J.E. Tarjan, R.E. |
| Author_xml | – sequence: 1 givenname: J.E. surname: Hopcroft fullname: Hopcroft, J.E. – sequence: 2 givenname: R.E. surname: Tarjan fullname: Tarjan, R.E. |
| BookMark | eNqFkEtLQzEQhYNUsK3-BCFLXVydJM194EJKqQ8ouPCxDWkebeTem0sSBP-9aSsu3HQWMwycM8P5JmjU-94gdEnghgApb18BKC0g11XFrmsAwgp2gsYEGihoRWcjNP6TnKFJjJ9ZQ3jJxmg-xx-49ZvcZbvxwaVth60P2EXf-TBsXeywtzgFp3zfG5WMxkMrexnwJshhG8_RqZVtNBe_c4reH5Zvi6di9fL4vJivCkUpTYVlljdSN0Sb2nJWqvwfSk5UbbjUeg1VCVJzyTQl9cxos4a8NaRZ05mWvGFTxA93VfAxBmPFEFwnw7cgIHYcxJ6D2IUUFRN7DoJl390_n3JJJuf7FKRrj7rvD26To305E0RUzvTKaBcyDKG9O3LhB4pEeNk |
| CitedBy_id | crossref_primary_10_1137_20M1314987 crossref_primary_10_1145_2532569 crossref_primary_10_1177_0954406215583321 crossref_primary_10_1016_0010_4485_89_90158_9 crossref_primary_10_1002_jgt_20293 crossref_primary_10_1007_BF02252027 crossref_primary_10_1007_BF02684448 crossref_primary_10_1016_0010_4485_94_90094_9 crossref_primary_10_1007_BF01910632 crossref_primary_10_1016_0009_2614_93_85191_P crossref_primary_10_1142_s0129054115500161 crossref_primary_10_1109_31_1743 crossref_primary_10_1016_0022_0000_82_90015_0 crossref_primary_10_1115_1_1315299 crossref_primary_10_1088_1742_6596_1333_3_032013 crossref_primary_10_1016_0167_8655_93_90137_3 crossref_primary_10_1137_1020067 crossref_primary_10_1006_jagm_1998_0943 crossref_primary_10_1016_0010_4655_88_90157_9 crossref_primary_10_1109_31_1746 crossref_primary_10_1137_0604018 crossref_primary_10_1145_3686798 crossref_primary_10_1021_ci4005173 crossref_primary_10_1145_3550496 crossref_primary_10_1016_j_jsc_2013_06_002 crossref_primary_10_1016_S0169_023X_02_00027_7 crossref_primary_10_1145_3333003 crossref_primary_10_4028_www_scientific_net_AMR_199_200_392 crossref_primary_10_1007_s00224_015_9645_1 crossref_primary_10_1016_0022_0000_84_90011_4 crossref_primary_10_2118_203958_PA crossref_primary_10_1137_0210015 crossref_primary_10_1137_140999980 crossref_primary_10_1017_S0269888900007815 crossref_primary_10_1016_0020_0190_89_90102_6 crossref_primary_10_1080_0022250X_1990_9990067 crossref_primary_10_1017_S0890060400001098 crossref_primary_10_1109_12_24304 |
| Cites_doi | 10.1145/321556.321562 10.1016/0020-0190(71)90019-6 10.1109/TCT.1966.1082573 10.2307/2371125 |
| ContentType | Journal Article |
| Copyright | 1973 Academic Press, Inc. |
| Copyright_xml | – notice: 1973 Academic Press, Inc. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/S0022-0000(73)80013-3 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 331 |
| ExternalDocumentID | 10_1016_S0022_0000_73_80013_3 S0022000073800133 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c222t-f3f59ad91de8f536c1560651c8e5addb0760ad5a3d2184edeb0d5a919b24da593 |
| IEDL.DBID | IXB |
| ISSN | 0022-0000 |
| IngestDate | Wed Oct 01 03:40:05 EDT 2025 Thu Apr 24 22:51:05 EDT 2025 Fri Feb 23 02:19:41 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c222t-f3f59ad91de8f536c1560651c8e5addb0760ad5a3d2184edeb0d5a919b24da593 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0022000073800133 |
| PageCount | 9 |
| ParticipantIDs | crossref_primary_10_1016_S0022_0000_73_80013_3 crossref_citationtrail_10_1016_S0022_0000_73_80013_3 elsevier_sciencedirect_doi_10_1016_S0022_0000_73_80013_3 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1973-00-00 |
| PublicationDateYYYYMMDD | 1973-01-01 |
| PublicationDate_xml | – year: 1973 text: 1973-00-00 |
| PublicationDecade | 1970 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 1973 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Tarjan (bib8) 1971 Corneil, Gotlieb (bib2) 1970; 17 Hopcroft (bib3) 1972 Weinberg (bib9) 1966; 13 Cook (bib1) 1972 Hopcroft, Tarjan (bib7) 1971; 1 Hopcroft, Tarjan (bib6) 1972 Hopcroft (bib4) 1971 Whitney (bib10) 1993; 55 Hopcroft, Tarjan (bib5) 1972 Cook (10.1016/S0022-0000(73)80013-3_bib1) 1972 Hopcroft (10.1016/S0022-0000(73)80013-3_bib3) 1972 Hopcroft (10.1016/S0022-0000(73)80013-3_bib5) 1972 Hopcroft (10.1016/S0022-0000(73)80013-3_bib7) 1971; 1 Hopcroft (10.1016/S0022-0000(73)80013-3_bib4) 1971 Corneil (10.1016/S0022-0000(73)80013-3_bib2) 1970; 17 Whitney (10.1016/S0022-0000(73)80013-3_bib10) 1993; 55 Hopcroft (10.1016/S0022-0000(73)80013-3_bib6) 1972 Tarjan (10.1016/S0022-0000(73)80013-3_bib8) 1971 Weinberg (10.1016/S0022-0000(73)80013-3_bib9) 1966; 13 |
| References_xml | – year: 1972 ident: bib3 article-title: An publication-title: Theory of Machines and Computations – volume: 55 start-page: 231 year: 1993 end-page: 235 ident: bib10 article-title: A set of topological invariants for graphs publication-title: Amer. J. Math. – year: 1972 ident: bib6 article-title: Isomorphism of planar graphs (working paper) publication-title: Complexity of Computer Computations – year: 1971 ident: bib8 article-title: An Efficient Planarity Algorithm publication-title: TR STAN-CS-244-71 – year: 1971 ident: bib4 article-title: An publication-title: Technical Report STAN-CS-71-192 – volume: 13 start-page: 142 year: 1966 end-page: 148 ident: bib9 article-title: A simple and efficient algorithm for determining isomorphism of planar triply connected graphs publication-title: IEEE Trans. on Circuit Theory – volume: 1 start-page: 32 year: 1971 end-page: 34 ident: bib7 article-title: A publication-title: Inform. Process. Lett. – start-page: 174 year: 1972 end-page: 179 ident: bib1 article-title: Linear time simulation of deterministic two-way pushdown automata publication-title: IFIP Congress 71: Foundations of Information Processing, Proceedings – volume: 17 start-page: 51 year: 1970 end-page: 64 ident: bib2 article-title: An efficient algorithm for graph isomorphism publication-title: J. ACM – year: 1972 ident: bib5 article-title: Efficient Planarity Testing publication-title: Technical Report 72-125 – year: 1971 ident: 10.1016/S0022-0000(73)80013-3_bib4 article-title: An n log n Algorithm for Isomorphism of Planar Triply Connected Graphs – volume: 17 start-page: 51 year: 1970 ident: 10.1016/S0022-0000(73)80013-3_bib2 article-title: An efficient algorithm for graph isomorphism publication-title: J. ACM doi: 10.1145/321556.321562 – volume: 1 start-page: 32 year: 1971 ident: 10.1016/S0022-0000(73)80013-3_bib7 article-title: A V2 algorithm for determining isomorphism of planar graphs publication-title: Inform. Process. Lett. doi: 10.1016/0020-0190(71)90019-6 – start-page: 174 year: 1972 ident: 10.1016/S0022-0000(73)80013-3_bib1 article-title: Linear time simulation of deterministic two-way pushdown automata – year: 1972 ident: 10.1016/S0022-0000(73)80013-3_bib3 article-title: An n log n algorithm for minimizing states in a finite automation – year: 1972 ident: 10.1016/S0022-0000(73)80013-3_bib5 article-title: Efficient Planarity Testing – year: 1972 ident: 10.1016/S0022-0000(73)80013-3_bib6 article-title: Isomorphism of planar graphs (working paper) – year: 1971 ident: 10.1016/S0022-0000(73)80013-3_bib8 article-title: An Efficient Planarity Algorithm – volume: 13 start-page: 142 year: 1966 ident: 10.1016/S0022-0000(73)80013-3_bib9 article-title: A simple and efficient algorithm for determining isomorphism of planar triply connected graphs publication-title: IEEE Trans. on Circuit Theory doi: 10.1109/TCT.1966.1082573 – volume: 55 start-page: 231 year: 1993 ident: 10.1016/S0022-0000(73)80013-3_bib10 article-title: A set of topological invariants for graphs publication-title: Amer. J. Math. doi: 10.2307/2371125 |
| SSID | ssj0011563 |
| Score | 1.2702917 |
| Snippet | An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 323 |
| Title | A V log V algorithm for isomorphism of triconnected planar graphs |
| URI | https://dx.doi.org/10.1016/S0022-0000(73)80013-3 |
| Volume | 7 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier ScienceDirect Open Access Journals customDbUrl: eissn: 1090-2724 dateEnd: 20211102 omitProxy: true ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: IXB dateStart: 19670401 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1090-2724 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AKRWK dateStart: 19670401 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLamneDAY4B4KwcOcChrm6RNjmNiGhw4MbRblSYpVNrWaRv_H6ePbUgIJC6VGtVWZaX2l9r-DHDjW4xLRmrP5wjfWBZoTzArPJ1GRsQyy2xV5fsSDUfseczHLeg3vTCurLL2_ZVPL711vdKtrdmd57nr8Q3DMhNHhQMyjvGTMuHGNzyNH9aZBDyf0IYx3D296eKpNJSLtzG9K5V49Of4tBVzBgewV4NF0qve5xBadtaB_WYQA6m_yw7sbrEKHkGvR94IujS8qsl7gaf_jylBbEryZTEt0K75ckqKjDhuflfmohF0kvlEzdSClPzVy2MYDR5f-0OvnpTgaYzvKy-jGZfKyMBYkXEaadcfHfFAC8vRgaUu_aYMV9S4E501NvXxTgYyDZlRXNITaM-KmT0FEkqfWhMZIyLBmJXCtxZVxbGSiKWi8AxYY59E1zTibprFJNnUi6FZXVLbT2KalGZN6Bncr8XmFY_GXwKiMX7ybUMk6Ot_Fz3_v-gF7AQyptU_lktorxaf9gpRxyq9LrfVFwH_zNA |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEJ4gHtSDD9SIzz140EO17Xbb3SMSCSpyAsOtabtbbQItAfz_zvYBmBhNvDTppjNpJttvvu28AK5NhX5JisgwGdI3J7YigzuKG1HoSu6JOFZFlm_f7Q6d5xEb1aBd1cLotMoS-wtMz9G6XLkvrXk_TRJd42vbeSSOck1k6AZsOgzZia7iGz0sQwl4QKFVy3D9-KqMp1CRL9549DbXYtCfHdSa0-nsw27JFkmreKEDqKm0AXvVJAZSfpgN2FlrK3gIrRZ5I4hpeA3G7xke_z8mBMkpSebZJEPDJvMJyWKim_PrPJcIWSeZjoM0mJG8gfX8CIadx0G7a5SjEowIHfzCiGnMRCCFJRWPGXUjXSDtMiviiiGChTr-FkgWUKmPdEqq0MQ7YYnQdmTABD2Gepql6gSILUyqpCsld7njKMFNpVCV5wUCyZRrN8Gp7ONHZR9xPc5i7K8SxtCsOqpt-h71c7P6tAl3S7Fp0UjjLwFeGd__tiN8BPvfRU__L3oFW93Ba8_vPfVfzmDbEh4tfricQ30x-1QXSEEW4WW-xb4AcV7P9g |
| 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=A+V+log+V+algorithm+for+isomorphism+of+triconnected+planar+graphs&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Hopcroft%2C+J.E.&rft.au=Tarjan%2C+R.E.&rft.date=1973&rft.issn=0022-0000&rft.volume=7&rft.issue=3&rft.spage=323&rft.epage=331&rft_id=info:doi/10.1016%2FS0022-0000%2873%2980013-3&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0022_0000_73_80013_3 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |