Incremental maintenance of the 5-edge-connectivity classes of a graph
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 285 |
|---|---|
| container_issue | |
| container_start_page | 272 |
| container_title | |
| container_volume | |
| creator | DINITZ, Y NOSSENSON, R |
| description | |
| doi_str_mv | 10.1007/3-540-44985-X |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_1377409</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1377409</sourcerecordid><originalsourceid>FETCH-LOGICAL-p184t-40c763159608f3cdfa3080fc917653ee5d8e362a8d41ee893fc79ce99700bc373</originalsourceid><addsrcrecordid>eNotjktLAzEUhYMPsNRZus_CbfRmbp5LKdUWCm4U3JWYuWlHZtJhMgj9947o2ZzFd_g4jN1JeJAA9hGFViCU8k6Ljwu2kEZKgaj8Jau8dThTY40HdcUWgFALbxXesKqUL5iDtZRGLdh6m-NIPeUpdLwPbZ4ohxyJnxKfjsS1oOZAIp5ypji13-105rELpVD5nQR-GMNwvGXXKXSFqv9esvfn9dtqI3avL9vV004M0qlJKIjWoNTegEsYmxQQHKTopTUaiXTjCE0dXKMkkfOYovWRvLcAnxEtLtn9n3cIJYYujfPVtuyHse3DeN5LtFaBxx-mQU_q</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Incremental maintenance of the 5-edge-connectivity classes of a graph</title><source>Springer Books</source><creator>DINITZ, Y ; NOSSENSON, R</creator><creatorcontrib>DINITZ, Y ; NOSSENSON, R</creatorcontrib><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540676904</identifier><identifier>ISBN: 3540676902</identifier><identifier>EISSN: 1611-3349</identifier><identifier>DOI: 10.1007/3-540-44985-X</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Combinatorics ; Combinatorics. Ordered structures ; Computer science; control theory; systems ; Data processing. List processing. Character string processing ; Exact sciences and technology ; Graph theory ; Mathematics ; Memory organisation. Data processing ; Sciences and techniques of general use ; Software ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2000, p.272-285</ispartof><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,780,784,789,790,4048,4049,27923</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1377409$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>DINITZ, Y</creatorcontrib><creatorcontrib>NOSSENSON, R</creatorcontrib><title>Incremental maintenance of the 5-edge-connectivity classes of a graph</title><title>Lecture notes in computer science</title><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Combinatorics</subject><subject>Combinatorics. Ordered structures</subject><subject>Computer science; control theory; systems</subject><subject>Data processing. List processing. Character string processing</subject><subject>Exact sciences and technology</subject><subject>Graph theory</subject><subject>Mathematics</subject><subject>Memory organisation. Data processing</subject><subject>Sciences and techniques of general use</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540676904</isbn><isbn>3540676902</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2000</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotjktLAzEUhYMPsNRZus_CbfRmbp5LKdUWCm4U3JWYuWlHZtJhMgj9947o2ZzFd_g4jN1JeJAA9hGFViCU8k6Ljwu2kEZKgaj8Jau8dThTY40HdcUWgFALbxXesKqUL5iDtZRGLdh6m-NIPeUpdLwPbZ4ohxyJnxKfjsS1oOZAIp5ypji13-105rELpVD5nQR-GMNwvGXXKXSFqv9esvfn9dtqI3avL9vV004M0qlJKIjWoNTegEsYmxQQHKTopTUaiXTjCE0dXKMkkfOYovWRvLcAnxEtLtn9n3cIJYYujfPVtuyHse3DeN5LtFaBxx-mQU_q</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>DINITZ, Y</creator><creator>NOSSENSON, R</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>Incremental maintenance of the 5-edge-connectivity classes of a graph</title><author>DINITZ, Y ; NOSSENSON, R</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p184t-40c763159608f3cdfa3080fc917653ee5d8e362a8d41ee893fc79ce99700bc373</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Combinatorics</topic><topic>Combinatorics. Ordered structures</topic><topic>Computer science; control theory; systems</topic><topic>Data processing. List processing. Character string processing</topic><topic>Exact sciences and technology</topic><topic>Graph theory</topic><topic>Mathematics</topic><topic>Memory organisation. Data processing</topic><topic>Sciences and techniques of general use</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>DINITZ, Y</creatorcontrib><creatorcontrib>NOSSENSON, R</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>DINITZ, Y</au><au>NOSSENSON, R</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Incremental maintenance of the 5-edge-connectivity classes of a graph</atitle><btitle>Lecture notes in computer science</btitle><date>2000</date><risdate>2000</risdate><spage>272</spage><epage>285</epage><pages>272-285</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540676904</isbn><isbn>3540676902</isbn><cop>Berlin</cop><pub>Springer</pub><doi>10.1007/3-540-44985-X</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2000, p.272-285 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1377409 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer science control theory systems Data processing. List processing. Character string processing Exact sciences and technology Graph theory Mathematics Memory organisation. Data processing Sciences and techniques of general use Software Theoretical computing |
| title | Incremental maintenance of the 5-edge-connectivity classes of a graph |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T16%3A48%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Incremental%20maintenance%20of%20the%205-edge-connectivity%20classes%20of%20a%20graph&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=DINITZ,%20Y&rft.date=2000&rft.spage=272&rft.epage=285&rft.pages=272-285&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540676904&rft.isbn_list=3540676902&rft_id=info:doi/10.1007/3-540-44985-X&rft_dat=%3Cpascalfrancis%3E1377409%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |