Streaming algorithm for graph spanners—single pass and constant processing time per edge
Gespeichert in:
| Veröffentlicht in: | Information processing letters Jg. 106; H. 3; S. 110 - 114 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
Elsevier B.V
30.04.2008
Elsevier Science |
| Schlagworte: | |
| ISSN: | 0020-0190, 1872-6119 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Author | Baswana, Surender |
|---|---|
| Author_xml | – sequence: 1 givenname: Surender surname: Baswana fullname: Baswana, Surender email: sbaswana@cse.iitk.ac.in organization: Department of Computer Science & Engineering, Indian Institute of Technology, Kanpur 208016, India |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20250403$$DView record in Pascal Francis |
| BookMark | eNp9kDtOxDAQhi0EEsvjAHRuKBNmnE2cFRVCvCQkCqChsWxnsniVdSLbQqLjEJyQk-DVIgoKmplivm808x-wXT96YuwEoUTA5mxVumkoBYAsEUsA3GEzbKUoGsTFLpsBCCgAF7DPDmJcAUAzr-SMvTymQHrt_JLrYTkGl17XvB8DXwY9vfI4ae8pxK-Pz5iZgfikY-Tad9yOPibtE5_CaCluxjy5dSYocOqWdMT2ej1EOv7ph-z5-urp8ra4f7i5u7y4L2wlZCo6aaywhnqyVdPCQpq21aY22FNFKHOtxVxWRDXULZGhthJa1E1nyGhhsDpkp9u9-TSrhz5ob11UU3BrHd6VAFHDHKrM4ZazYYwxUP-LIKhNiGqlcohqE6JCVDnE7Mg_jnVJJzf6FLQb_jXPtybl198cBRWtI2-pc4FsUt3o_rG_AUBjkXM |
| CODEN | IFPLAT |
| CitedBy_id | crossref_primary_10_1007_s00446_009_0091_7 crossref_primary_10_1145_2627692_2627694 crossref_primary_10_1137_070683155 crossref_primary_10_1145_3274651 crossref_primary_10_1007_s00446_017_0306_2 crossref_primary_10_1145_3469834 crossref_primary_10_1145_2836167 crossref_primary_10_1137_22M1489034 crossref_primary_10_1007_s00446_015_0246_7 crossref_primary_10_1137_19M1286955 crossref_primary_10_1137_16M1097808 crossref_primary_10_1016_j_ipl_2010_10_017 crossref_primary_10_1145_1921659_1921666 crossref_primary_10_1177_0278364915576491 crossref_primary_10_1016_j_cosrev_2020_100253 crossref_primary_10_1145_2344422_2344425 crossref_primary_10_1145_2957322 crossref_primary_10_1137_22M1534572 |
| Cites_doi | 10.1145/4221.4227 10.1007/BF02189308 10.1002/rsa.20130 10.1002/jgt.3190130114 |
| ContentType | Journal Article |
| Copyright | 2007 Elsevier B.V. 2008 INIST-CNRS |
| Copyright_xml | – notice: 2007 Elsevier B.V. – notice: 2008 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1016/j.ipl.2007.11.001 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1872-6119 |
| EndPage | 114 |
| ExternalDocumentID | 20250403 10_1016_j_ipl_2007_11_001 S002001900700302X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH |
| ID | FETCH-LOGICAL-c327t-d7bc2cbefec368097b88ab5b1fe3e17fe352473ee5058eebe832a256dbeba2b13 |
| ISICitedReferencesCount | 40 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000255676500005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0190 |
| IngestDate | Mon Jul 21 09:17:30 EDT 2025 Sat Nov 29 03:44:15 EST 2025 Tue Nov 18 20:52:13 EST 2025 Fri Feb 23 02:30:02 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Streaming Shortest path Analysis of algorithms On-line algorithms Spanner Computer theory Information processing Processing time Algorithm analysis Graph algorithm |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c327t-d7bc2cbefec368097b88ab5b1fe3e17fe352473ee5058eebe832a256dbeba2b13 |
| PageCount | 5 |
| ParticipantIDs | pascalfrancis_primary_20250403 crossref_primary_10_1016_j_ipl_2007_11_001 crossref_citationtrail_10_1016_j_ipl_2007_11_001 elsevier_sciencedirect_doi_10_1016_j_ipl_2007_11_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-04-30 |
| PublicationDateYYYYMMDD | 2008-04-30 |
| PublicationDate_xml | – month: 04 year: 2008 text: 2008-04-30 day: 30 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Information processing letters |
| PublicationYear | 2008 |
| Publisher | Elsevier B.V Elsevier Science |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Science |
| References | J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, J. Zhang, Graph distances in the streaming model: the value of space, in: Proceedings of 16th Annual ACM–SIAM Symposium on Discrete Algorithms, 2005, pp. 745–754 Elkin (bib005) 2007; vol. 4596 Elkin, Peleg (bib006) 2000; vol. 1853 Peleg, Schäffer (bib013) 1989; 13 Ausiello, Demetrescu, Franciosa, Italiano, Ribichini (bib002) 2007; vol. 4698 Erdős (bib007) 1964; vol. 1963 Feigenbaum, Kannan, McGregor, Suri, Zhang (bib008) 2004; vol. 3142 McGregor (bib012) 2005; vol. 3624 Baswana, Sen (bib004) 2007; 30 Henzinger, Raghavan, Rajagopalan (bib011) 1999; vol. 50 Althöfer, Das, Dobkin, Joseph, Soares (bib001) 1993; 9 Awerbuch (bib003) 1985 S. Halperin, U. Zwick, Linear time deterministic algorithm for computing spanners for unweighted graphs, unpublished manuscript, 1996 Feigenbaum (10.1016/j.ipl.2007.11.001_bib008) 2004; vol. 3142 McGregor (10.1016/j.ipl.2007.11.001_bib012) 2005; vol. 3624 Althöfer (10.1016/j.ipl.2007.11.001_bib001) 1993; 9 Baswana (10.1016/j.ipl.2007.11.001_bib004) 2007; 30 Elkin (10.1016/j.ipl.2007.11.001_bib005) 2007; vol. 4596 Awerbuch (10.1016/j.ipl.2007.11.001_bib003) 1985 Henzinger (10.1016/j.ipl.2007.11.001_bib011) 1999; vol. 50 Peleg (10.1016/j.ipl.2007.11.001_bib013) 1989; 13 Ausiello (10.1016/j.ipl.2007.11.001_bib002) 2007; vol. 4698 10.1016/j.ipl.2007.11.001_bib010 Elkin (10.1016/j.ipl.2007.11.001_bib006) 2000; vol. 1853 Erdős (10.1016/j.ipl.2007.11.001_bib007) 1964; vol. 1963 10.1016/j.ipl.2007.11.001_bib009 |
| References_xml | – volume: vol. 4698 start-page: 605 year: 2007 end-page: 617 ident: bib002 article-title: Small stretch spanners in the streaming model: New algorithms and experiments publication-title: Proceedings of 15th Annual European Symposium on Algorithms – volume: 30 start-page: 532 year: 2007 end-page: 563 ident: bib004 article-title: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs publication-title: Random Structures and Algorithms – volume: vol. 1963 start-page: 29 year: 1964 end-page: 36 ident: bib007 article-title: Extremal problems in graph theory publication-title: Theory of Graphs and its Applications – volume: vol. 50 start-page: 107 year: 1999 end-page: 118 ident: bib011 article-title: Computing on data streams publication-title: DIMACS Series in Discrete Mathematics and Theoretical Computer Science – volume: vol. 3142 start-page: 531 year: 2004 end-page: 543 ident: bib008 article-title: On graph problems in a semi-streaming model publication-title: Proceedings of 31st International Colloquium on Automata, Languages and Programming – volume: 9 start-page: 81 year: 1993 end-page: 100 ident: bib001 article-title: On sparse spanners of weighted graphs publication-title: Discrete and Computational Geometry – volume: vol. 4596 start-page: 716 year: 2007 end-page: 727 ident: bib005 article-title: Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners publication-title: Proceedings of 13th Annual European Symposium on Algorithms – volume: vol. 3624 start-page: 170 year: 2005 end-page: 181 ident: bib012 article-title: Finding graph matchings in streaming model publication-title: Proceedings of 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems – volume: vol. 1853 start-page: 636 year: 2000 end-page: 648 ident: bib006 article-title: Strong inapproximability of the basic publication-title: Proceedings of 27th International Colloquium on Automata, Languages and Programming – reference: S. Halperin, U. Zwick, Linear time deterministic algorithm for computing spanners for unweighted graphs, unpublished manuscript, 1996 – reference: J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, J. Zhang, Graph distances in the streaming model: the value of space, in: Proceedings of 16th Annual ACM–SIAM Symposium on Discrete Algorithms, 2005, pp. 745–754 – volume: 13 start-page: 99 year: 1989 end-page: 116 ident: bib013 article-title: Graph spanners publication-title: Journal of Graph Theory – start-page: 804 year: 1985 end-page: 823 ident: bib003 article-title: Complexity of network synchronization publication-title: Journal of ACM – start-page: 804 year: 1985 ident: 10.1016/j.ipl.2007.11.001_bib003 article-title: Complexity of network synchronization publication-title: Journal of ACM doi: 10.1145/4221.4227 – volume: vol. 4596 start-page: 716 year: 2007 ident: 10.1016/j.ipl.2007.11.001_bib005 article-title: Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners – volume: vol. 3624 start-page: 170 year: 2005 ident: 10.1016/j.ipl.2007.11.001_bib012 article-title: Finding graph matchings in streaming model – volume: vol. 1853 start-page: 636 year: 2000 ident: 10.1016/j.ipl.2007.11.001_bib006 article-title: Strong inapproximability of the basic k-spanner problem – volume: 9 start-page: 81 year: 1993 ident: 10.1016/j.ipl.2007.11.001_bib001 article-title: On sparse spanners of weighted graphs publication-title: Discrete and Computational Geometry doi: 10.1007/BF02189308 – volume: vol. 1963 start-page: 29 year: 1964 ident: 10.1016/j.ipl.2007.11.001_bib007 article-title: Extremal problems in graph theory – volume: vol. 50 start-page: 107 year: 1999 ident: 10.1016/j.ipl.2007.11.001_bib011 article-title: Computing on data streams – ident: 10.1016/j.ipl.2007.11.001_bib009 – volume: 30 start-page: 532 year: 2007 ident: 10.1016/j.ipl.2007.11.001_bib004 article-title: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs publication-title: Random Structures and Algorithms doi: 10.1002/rsa.20130 – volume: 13 start-page: 99 year: 1989 ident: 10.1016/j.ipl.2007.11.001_bib013 article-title: Graph spanners publication-title: Journal of Graph Theory doi: 10.1002/jgt.3190130114 – volume: vol. 4698 start-page: 605 year: 2007 ident: 10.1016/j.ipl.2007.11.001_bib002 article-title: Small stretch spanners in the streaming model: New algorithms and experiments – ident: 10.1016/j.ipl.2007.11.001_bib010 – volume: vol. 3142 start-page: 531 year: 2004 ident: 10.1016/j.ipl.2007.11.001_bib008 article-title: On graph problems in a semi-streaming model |
| SSID | ssj0006437 |
| Score | 2.1044497 |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 110 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Analysis of algorithms Applied sciences Computer science; control theory; systems Exact sciences and technology Information retrieval. Graph Miscellaneous On-line algorithms Shortest path Spanner Streaming Theoretical computing |
| Title | Streaming algorithm for graph spanners—single pass and constant processing time per edge |
| URI | https://dx.doi.org/10.1016/j.ipl.2007.11.001 |
| Volume | 106 |
| WOSCitedRecordID | wos000255676500005&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIEXJ dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlgMS4l1RHtUeOBG5yq6d7PpYoSLgUCFRpIiL2V2PIZXjWklaeuRH8Av5Jcy-HKdABUhcVonlh-Lv28ns7HwzhDwrq6piQqok19okWQo60SWDRKmxawHH5ES7ZhPi6EhOp_nbweBj1MKc16Jp5MVF3v5XqPEYgm2ls38Bd3dTPICfEXQcEXYc_wh4u8-s5k57WH86xbX_57nLJXSlqYdoQGyzrWVMcshsrKCGYYtOdNC4OYdxNWy9hMDJqWZzsAWOh5dTh4KYyXGod37tNELrALxaflFee_bubOF6120EG2Rv38RFwH5SwQRFgE1u820_98EbUik4LkuDOYyWdjTpUSrt2U0WclshfMt-ad19oOFkf9bWvvikrb8aYiGbRbPtHrT1Xm01IzRjfHqNbHMxztF0bx-8Ppy-6f6t7calTwPyvyHufLscwEsP-p3vchMxwhlV-VYoPf_k-A65FRYW9MAT4i4ZQHOP3I5NO2iw4ffJh44ftOMHRRSp4weN_Pj-9ZtnBrXMoMgMGplB10hTywyKzKCWGQ_I-5eHxy9eJaHBRmJSLlZJKbThRkMFJp3IUS60lEqPNasgBSZwHPNMpADoJkvA6Y7mX6GPXGrQimuW7pCt5rSBh4QaXKWVKdOszEyWS1AZgEBfVAkpc1PxXTKKr64wofq8bYJSFzHN8KTAt227ogpcldpUy13yvLuk9aVXrjo5i3gUwXf0PmGB5Lnqsr0N7LoHcVfbb5Q--rf7PiY31tPnCdlaLc7gKbluzlez5WIvcPAHWAahzw |
| 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=Streaming+algorithm+for+graph+spanners%E2%80%94single+pass+and+constant+processing+time+per+edge&rft.jtitle=Information+processing+letters&rft.au=Baswana%2C+Surender&rft.date=2008-04-30&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=106&rft.issue=3&rft.spage=110&rft.epage=114&rft_id=info:doi/10.1016%2Fj.ipl.2007.11.001&rft.externalDocID=S002001900700302X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon |