Orderly Spanning Trees with Applications
We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected p...
Gespeichert in:
| Veröffentlicht in: | SIAM journal on computing Jg. 34; H. 4; S. 924 - 945 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Philadelphia, PA
Society for Industrial and Applied Mathematics
01.01.2005
|
| Schlagworte: | |
| ISSN: | 0097-5397, 1095-7111 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning tree of H. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's realizer theorem, (2) the first algorithm for computing an area-optimal 2-visibility drawing of a planar graph, and (3) the most compact known encoding of a planar graph with O(1)-time query support. All algorithms in this paper run in linear time. |
|---|---|
| AbstractList | We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning tree of H. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's realizer theorem, (2) the first algorithm for computing an area-optimal 2-visibility drawing of a planar graph, and (3) the most compact known encoding of a planar graph with O(1)-time query support. All algorithms in this paper run in linear time. |
| Author | Lin, Ching-Chi Lu, Hsueh-I Chiang, Yi-Ting |
| Author_xml | – sequence: 1 givenname: Yi-Ting surname: Chiang fullname: Chiang, Yi-Ting – sequence: 2 givenname: Ching-Chi surname: Lin fullname: Lin, Ching-Chi – sequence: 3 givenname: Hsueh-I surname: Lu fullname: Lu, Hsueh-I |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16983445$$DView record in Pascal Francis |
| BookMark | eNp1UE1LAzEQDVLBtvoDvC2C4GU1s9ndJMdS_IJCD63nMJtNNGXNrskW6b93a4sHxdPAvI958yZk5FtvCLkEegvA-N2KUskLJjnN8mEh4ISMgcoi5QAwIuM9nO7xMzKJcUMp5DmwMblZhtqEZpesOvTe-ddkHYyJyafr35JZ1zVOY-9aH8_JqcUmmovjnJKXh_v1_CldLB-f57NFqhnN-hSlzYQobMmrUgtBa5SoS1tZawTmmaQsA0brsmRcDLmBsrrCwgBUIkeUFZuSq4NvF9qPrYm92rTb4IeTSoLgHMoh95RcH0kYNTY2oNcuqi64dww7BaUULM-LgccPPB3aGIOxSrv--58-oGsUULVvT_1pb1DCL-WP-b-aL08PcI4 |
| CitedBy_id | crossref_primary_10_1007_s00453_015_0086_7 crossref_primary_10_1016_j_tcs_2015_09_004 crossref_primary_10_1145_1198513_1198516 crossref_primary_10_1111_cgf_12648 crossref_primary_10_1145_2344422_2344432 crossref_primary_10_1016_j_comgeo_2020_101630 crossref_primary_10_1007_s00453_013_9815_y crossref_primary_10_1145_1367064_1367068 crossref_primary_10_1145_2601073 crossref_primary_10_1007_s00453_010_9452_7 crossref_primary_10_1016_j_comgeo_2022_101922 crossref_primary_10_1093_comjnl_bxaf051 crossref_primary_10_1137_060651811 crossref_primary_10_1016_j_tcs_2021_04_014 crossref_primary_10_1016_j_tcs_2016_04_031 crossref_primary_10_1145_2151171_2151173 crossref_primary_10_1016_j_tcs_2014_10_006 crossref_primary_10_1007_s00454_007_9027_9 crossref_primary_10_1016_j_jcss_2011_09_002 crossref_primary_10_1137_070703041 crossref_primary_10_1137_120879142 crossref_primary_10_1016_j_ipl_2010_06_014 crossref_primary_10_1137_15M1030030 |
| Cites_doi | 10.56021/9780801844256 10.1016/S0925-7721(98)00016-9 10.1007/BF02122694 10.1007/s004539900035 10.1016/S0022-0000(05)80064-9 10.1109/2945.764870 10.1007/BF00353652 10.1137/S0097539799359117 10.1137/S0097539796308874 10.1137/S0895480197325031 10.1016/0166-218X(93)E0150-W 10.1016/0022-0000(89)90032-9 10.1016/S0196-6774(03)00057-9 10.1137/0222035 10.1016/S0925-7721(99)00018-8 10.1145/321850.321852 10.1016/S0304-3975(95)00257-X 10.1016/0020-0190(95)00020-D 10.1016/S0166-218X(96)00029-7 10.1137/S0895480103420744 10.1137/S0097539795294165 10.4153/CJM-1963-029-x 10.1007/PL00009189 10.2307/2371374 10.1109/TIT.1975.1055349 10.1016/0166-218X(84)90126-4 10.1137/S0097539799364092 10.1137/S0097539795288246 |
| ContentType | Journal Article |
| Copyright | 2005 INIST-CNRS [Copyright] © 2005 Society for Industrial and Applied Mathematics |
| Copyright_xml | – notice: 2005 INIST-CNRS – notice: [Copyright] © 2005 Society for Industrial and Applied Mathematics |
| DBID | AAYXX CITATION IQODW 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 PTHSS PYCSY Q9U S0W U9A |
| DOI | 10.1137/S0097539702411381 |
| DatabaseName | CrossRef Pascal-Francis ProQuest Central (Corporate) Career & Technical Education Database ABI/INFORM Collection 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 Edition) Research Library (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection Agricultural & Environmental Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Business Premium Collection Technology Collection Natural Science Collection ProQuest One Community College ProQuest Materials Science Collection ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep 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 Databases ProQuest One Academic 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 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 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 Applied Sciences |
| EISSN | 1095-7111 |
| EndPage | 945 |
| ExternalDocumentID | 2574468151 16983445 10_1137_S0097539702411381 |
| 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 IQODW XJT 3V. 7XB 88A 88K 8AL 8FK JQ2 L.- M0N M2T MBDVC PKEHL PQEST PQUKI Q9U U9A |
| ID | FETCH-LOGICAL-c302t-a9f2885f67b6c880da9ac6fbffe8a429032130d66378137103dba5e11b84aa9b3 |
| IEDL.DBID | KB. |
| ISICitedReferencesCount | 43 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000229826500009&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 | Fri Jul 25 12:14:31 EDT 2025 Mon Jul 21 09:12:36 EDT 2025 Sat Nov 29 03:54:33 EST 2025 Tue Nov 18 21:30:48 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | 68P05 Isomorphic graph Tree(graph) Realizer Data compression Algorithmics Connected graph Linear time 68U05 Computing 94C15 Graph drawing Graph encoding Data structure visibility representation succinct data structure unit-cost RAM model Triangulation 68W35 Planar graph 05C85 orderly spanning tree data compression 05C62 Spanning tree Canonical ordering 68R10 planar graph algorithm |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c302t-a9f2885f67b6c880da9ac6fbffe8a429032130d66378137103dba5e11b84aa9b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| PQID | 918771641 |
| PQPubID | 666313 |
| PageCount | 22 |
| ParticipantIDs | proquest_journals_918771641 pascalfrancis_primary_16983445 crossref_citationtrail_10_1137_S0097539702411381 crossref_primary_10_1137_S0097539702411381 |
| PublicationCentury | 2000 |
| PublicationDate | 2005-01-00 2005 20050101 |
| PublicationDateYYYYMMDD | 2005-01-01 |
| PublicationDate_xml | – month: 01 year: 2005 text: 2005-01-00 |
| PublicationDecade | 2000 |
| PublicationPlace | Philadelphia, PA |
| PublicationPlace_xml | – name: Philadelphia, PA – name: Philadelphia |
| PublicationTitle | SIAM journal on computing |
| PublicationYear | 2005 |
| Publisher | Society for Industrial and Applied Mathematics |
| Publisher_xml | – name: Society for Industrial and Applied Mathematics |
| References | R41 R43 R20 R23 R22 R44 R25 R47 R24 R46 R27 R29 R28 Trotter William (R42) 1992 R5 R7 R8 R32 R31 R12 R11 R14 R13 R35 R38 R15 R37 R17 R19 |
| References_xml | – volume-title: Combinatorics and partially ordered sets year: 1992 ident: R42 doi: 10.56021/9780801844256 – ident: R7 doi: 10.1016/S0925-7721(98)00016-9 – ident: R11 doi: 10.1007/BF02122694 – ident: R27 doi: 10.1007/s004539900035 – ident: R17 doi: 10.1016/S0022-0000(05)80064-9 – ident: R37 doi: 10.1109/2945.764870 – ident: R38 doi: 10.1007/BF00353652 – ident: R23 doi: 10.1137/S0097539799359117 – ident: R20 doi: 10.1137/S0097539796308874 – ident: R22 doi: 10.1137/S0895480197325031 – ident: R29 doi: 10.1016/0166-218X(93)E0150-W – ident: R46 doi: 10.1016/0022-0000(89)90032-9 – ident: R31 doi: 10.1016/S0196-6774(03)00057-9 – ident: R47 doi: 10.1137/0222035 – ident: R25 doi: 10.1016/S0925-7721(99)00018-8 – ident: R24 doi: 10.1145/321850.321852 – ident: R28 doi: 10.1016/S0304-3975(95)00257-X – ident: R8 doi: 10.1016/0020-0190(95)00020-D – ident: R12 doi: 10.1016/S0166-218X(96)00029-7 – ident: R13 doi: 10.1016/S0166-218X(96)00029-7 – ident: R32 doi: 10.1137/S0895480103420744 – ident: R5 doi: 10.1137/S0097539795294165 – ident: R44 doi: 10.4153/CJM-1963-029-x – ident: R19 doi: 10.1007/PL00009189 – ident: R14 doi: 10.2307/2371374 – ident: R15 doi: 10.1109/TIT.1975.1055349 – ident: R43 doi: 10.1016/0166-218X(84)90126-4 – ident: R35 doi: 10.1137/S0097539799364092 – ident: R41 doi: 10.1137/S0097539795288246 |
| SSID | ssj0014413 |
| Score | 1.9435437 |
| Snippet | We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane... |
| SourceID | proquest pascalfrancis crossref |
| SourceType | Aggregation Database Index Database Enrichment Source |
| StartPage | 924 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Data compression Data processing. List processing. Character string processing Exact sciences and technology Graph theory Graphs Information retrieval. Graph Mathematics Memory organisation. Data processing Sciences and techniques of general use Software Theoretical computing |
| Title | Orderly Spanning Trees with Applications |
| URI | https://www.proquest.com/docview/918771641 |
| Volume | 34 |
| WOSCitedRecordID | wos000229826500009&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/eLvHCXMwpV1JSwMxFH6o9aCIu7iWOXgQIZpMZibJSVQsQu2i1vUyZDYQpNZOFfz3vqRpVQQvXj5myUDIS_K95GXeB7CLDMIKKjQRknISBJkmGhfORGrszCpUUtn0xbcXotmU9_eq7c7mlO5Y5WhOtBN19pKaPfJDxaQwvj076r0SIxplgqtOQWMSKsxHV9_EZE8OxkEEZHqXhFKQEHnXBTUZNxmjqfmjVAmkKHwg2Q9amuvpEluoGEpb_JqlLfXUFv5Z6UWYdz6ndzzsJEswkXeXYWGk5-C54b0Ms41xDtdyBfZaJivn84d33RvqGnmdfp6Xntm59Y6_xb1X4aZ21jk9J05XgaSc-gOiVeFLGRaRSKIUx2-mlU6jIimKXGrkJ8p9ZLYMfREhsbEY5Vmiw5yxRAZaq4SvwVT3pZuvg8dDlYVKJ2kmaZDSREpWyCjJuAxy4yptAB01a5y6pONG--I5tosPLuJfltiA_fEnvWHGjb8KV3_Y6uuLSBkFEazA1sgysRudZTw2y-afb7dgxiZqtRsu2zA16L_lOzCdvg-eyn4VJsXVpcG7hypUTs6a7Su8qwtStb0QsUFPLdYNMlO24bcsti12DAp7La4R2-HjJ_yu42w |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NS8NAEB20CiriR1Ws1ZqDggiLSTbJ7h5EiloU2ypYxVvcJBsQpNamKv1R_kdn81EtQm8evCbZZcm8zJvZyc4D2EMGsWKTScK4SYnjRJJITJwJlwhm4Qou0vbF903WbvOHB3EzBZ_FWRj9W2XhE1NHHb2Eeo_8SFic6djeOum9Ei0apYurhYJGhoorNfzAjC05vjxD8-7bduO8c3pBclEBElLTHhApYptzN_ZY4IUI3kgKGXpxEMeKS3TOJrXRrUdIxIxbFPmXRoF0lWUF3JFSBBTnnYYZBxMhrRTRsjujogVGFnnTS0Zc5Pm8iIqz6APJ-gSrYEiJeIFbYzS42JMJWiTOpDR-sUJKdY3lf_aSVmApj6mNevYRrMKU6pZhudCrMHL3VYaF1qhHbbIGB9e66-jz0LjtZbpNRqevVGLonWmj_qOuvw53f7L6DSh1X7pqEwzqisgVMggjbjqhGXBuxdwLIsodpUPBCpiFGf0wb6qutT2e_TS5osz_ZfkKHI6G9LKOIpMero1h43uEJ7RCCi6gWiDBz71P4o9gsDXx7i7MXXRaTb952b6qwnzalDbdXNqG0qD_pnZgNnwfPCX9WopzAx7_GjNfGxszSQ |
| 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=Orderly+spanning+trees+with+applications&rft.jtitle=SIAM+journal+on+computing&rft.au=CHIANG%2C+Yi-Ting&rft.au=LIN%2C+Ching-Chi&rft.au=LU%2C+Hsueh-I&rft.date=2005&rft.pub=Society+for+Industrial+and+Applied+Mathematics&rft.issn=0097-5397&rft.volume=34&rft.issue=4&rft.spage=924&rft.epage=945&rft_id=info:doi/10.1137%2FS0097539702411381&rft.externalDBID=n%2Fa&rft.externalDocID=16983445 |
| 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 |