Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths
Saved in:
| Published in | SIAM journal on computing |
|---|---|
| Format | Journal Article |
| Language | English |
| Online Access | Get full text |
| ISSN | 1095-7111 0097-5397 |
| DOI | 10.1137/16m1106225 |
Cover
| BookMark | eNpF0DFLAzEYgOEMdajVxV-QXU7zJZdLz60UrYWKQhXH42vuSy9wTUoSkfrrRRSc3u0dnnM2CTEQY1cgbgCUuYXmACAaKfWETUG0ujIAMGW0GPcx-TIcMncx8Xfy-6FQz5-w2MGHPV9RoISj_8LiY8h8vb7jrnJoS0yZY-h5GYhvj2Q9jnyJmXh0fDvEVCgX_oJlyBfszOGY6fKvM_b2cP-6fKw2z6v1crGprJRNqbRxO2m1tsa01rROzxHErq1r1SpUFuZ9Aw2ptne6d9YIIVVte1CkScJcGDVj17_fj3DE0yeOY3dM_oDp1IHofiC6fwj1DQJzVXk |
|---|---|
| ContentType | Journal Article |
| DBID | ADTOC UNPAY |
| DOI | 10.1137/16m1106225 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10.1137/16m1106225 |
| GroupedDBID | --Z -DZ -~X .4S .DC 123 4.4 7RQ 7WY 7X2 7XC 88I 8CJ 8FE 8FG 8FH 8FL 8G5 8V8 AALVN AASXH ABDBF ABDPE ABJCF ABKAD ABMZU ABPPZ ABUWG ACBEA ACGFO ACGOD ACIWK ACNCT ACPRK ACUHS ADBBV ADMHC ADTOC ADXHL AEMOZ AENEX AFKRA AFRAH AHQJS AKVCP ALMA_UNASSIGNED_HOLDINGS ANXRF ARAPS ARCSS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI BPHCQ CCPQU 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 UNPAY UQL VOH WH7 WHG XJE XJT YNT YYP YZZ ZCG ZY4 |
| ID | FETCH-LOGICAL-c226t-57fb2c55c779c79f58a10b944393a3c18d616e39df5dfc700234cd13e5e218073 |
| IEDL.DBID | UNPAY |
| ISSN | 1095-7111 0097-5397 |
| IngestDate | Tue Aug 19 20:12:51 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c226t-57fb2c55c779c79f58a10b944393a3c18d616e39df5dfc700234cd13e5e218073 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://epubs.siam.org/doi/pdf/10.1137/16M1106225 |
| ParticipantIDs | unpaywall_primary_10_1137_16m1106225 |
| PublicationTitle | SIAM journal on computing |
| Score | 2.2949405 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths |
| URI | https://epubs.siam.org/doi/pdf/10.1137/16M1106225 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BPBgO4s-oUdOD16Kza8u8ESNBE4hRiXgiXX8IEQZxI0b_et-2osaT3tutWd_b93V77_sATkwo5RlXjjrb1DQMlKAx4jyNGBfKIaNlxUGx2xOdfngz4IMKBMtemLwTLG2kYzUtfuPneT03zpuPyNNAdBGvBAbhCqwKjvS7Cqv93m3rqVSblJSz0lAFqQOVmMhekrScPPWTa7C2SObq_U1NJj_gpF2Hu-VCyiqSl8Yiixv645dG479WugHrnlySVhkNm1CxyRbUl8YNxOfxFtS6X2Kt6TbY1uR59jrORtOUIIUlj8XXUmsIjioqLYnXpl62bJLr6wuCz7206iEqMQQvR7yVPblEYCQzR-5HeSFvmpFbvFu6A_321cNlh3r3BaqRkmWUSxefa861lJGWkeNNFZzFUYgMhimmg6YRgbAsMo4bp2UO_qE2AbPcIm3AN8cuVJNZYveA8KjJdJwLyXMTitBGuV-WNErnZFIKsw8nX9sxnJcqG8PidMLk8HvXDv427BCq2evCHiFZyOJjHx6fhfu6gw |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BPBgO4s-oUdOD16Kza8u8ESNBE4hRiXgiXX8IEQZxI0b_et-2osaT3tutWd_b93V77_sATkwo5RlXjjrb1DQMlKAx4jyNGBfKIaNlxUGx2xOdfngz4IMKBMtemLwTLG2kYzUtfuPneT03zpuPyNNAdBGvBAbhCqwKjvS7Cqv93m3rqVSblJSz0lAFqQOVmMhekrScPPWTa7C2SObq_U1NJj_gpF2Hu-VCyiqSl8Yiixv645dG479WugHrnlySVhkNm1CxyRbUl8YNxOfxFtS6X2Kt6TbY1uR59jrORtOUIIUlj8XXUmsIjioqLYnXpl62bJLr6wuCz7206iEqMQQvR7yVPblEYCQzR-5HeSFvmpFbvFu6A_321cNlh3r3BaqRkmWUSxefa861lJGWkeNNFZzFUYgMhimmg6YRgbAsMo4bp2UO_qE2AbPcIm3AN8cuVJNZYveA8KjJdJwLyXMTitBGuV-WNErnZFIKsw8nX9sxnJcqG8PidMLk8HvXDv427BCq2evCHiFZyOJjHx6fhfu6gw |
| 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=Algorithms+for+Weighted+Matching+Generalizations+II%3A+f-factors+and+the+Special+Case+of+Shortest+Paths&rft.jtitle=SIAM+journal+on+computing&rft.issn=1095-7111&rft_id=info:doi/10.1137%2F16m1106225&rft.externalDocID=10.1137%2F16m1106225 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1095-7111&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1095-7111&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1095-7111&client=summon |