{"id":"https://openalex.org/W1997214284","doi":"https://doi.org/10.1137/0218008","title":"Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems","display_name":"Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems","publication_year":1989,"publication_date":"1989-02-01","ids":{"openalex":"https://openalex.org/W1997214284","doi":"https://doi.org/10.1137/0218008","mag":"1997214284"},"language":"en","primary_location":{"id":"doi:10.1137/0218008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218008","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015188847","display_name":"Greg N. Frederickson","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg N. Frederickson","raw_affiliation_strings":["Purdue University"],"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089539082","display_name":"Mandayam A. Srinivas","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mandayam A. Srinivas","raw_affiliation_strings":["Purdue University"],"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015188847"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.2514,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.55879292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"18","issue":"1","first_page":"112","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9847999811172485,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9759079813957214},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.8371468782424927},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7833564877510071},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.7129197120666504},{"id":"https://openalex.org/keywords/oriented-matroid","display_name":"Oriented matroid","score":0.6911579370498657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6797666549682617},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5827130079269409},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.5573792457580566},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5450199246406555},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4897589683532715},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4796348214149475},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.44013553857803345},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4153904318809509},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.41048464179039}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9759079813957214},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.8371468782424927},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7833564877510071},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.7129197120666504},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.6911579370498657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6797666549682617},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5827130079269409},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.5573792457580566},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5450199246406555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4897589683532715},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4796348214149475},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.44013553857803345},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4153904318809509},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.41048464179039},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/0218008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218008","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-1600","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/601","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"},{"id":"pmh:ADA191482","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA191482","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:urresearch.rochester.edu:5682","is_oa":false,"landing_page_url":"http://hdl.handle.net/1802/6137","pdf_url":null,"source":{"id":"https://openalex.org/S4306400518","display_name":"UR Research (University of Rochester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5388228","host_organization_name":"University of Rochester","host_organization_lineage":["https://openalex.org/I5388228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1522375947","https://openalex.org/W1968928800","https://openalex.org/W1982512167","https://openalex.org/W2011039300","https://openalex.org/W2018804864","https://openalex.org/W2025196649","https://openalex.org/W2034977257","https://openalex.org/W2036940456","https://openalex.org/W2054232722","https://openalex.org/W2054611719","https://openalex.org/W2084224084","https://openalex.org/W2121473031","https://openalex.org/W2125690626","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W1978795414","https://openalex.org/W2159059797","https://openalex.org/W4246417054","https://openalex.org/W1963746795","https://openalex.org/W173428383","https://openalex.org/W1978175514","https://openalex.org/W2124681589","https://openalex.org/W1997214284"],"abstract_inverted_index":{"Consider":[0],"a":[1,11,36,42,146,153,156,169],"matroid":[2,24,38,97,135],"of":[3,16,23,32,48,66,132,161,167],"rank":[4],"n":[5],"in":[6,29,117,151],"which":[7,30],"each":[8,128],"element":[9,115,136],"has":[10,44],"real-valued":[12],"cost":[13,131],"and":[14],"one":[15,31,114],"$d":[17],">":[18],"1$":[19],"colors.":[20],"A":[21,89,104],"class":[22],"intersection":[25,98],"problems":[26,67,99],"is":[27,35,78,92,102,106,137,177],"studied":[28],"the":[33,61,64,70,110,125,130,162,165],"matroids":[34],"partition":[37],"that":[39,41,85],"specifies":[40],"base":[43],"$q_j":[45],"$":[46],"elements":[47],"color":[49],"j,":[50],"for":[51,94,108,123,144],"$j":[52],"=":[53],"1,2,":[54],"\\cdots":[55,75],",d$.":[56],"Relationships":[57],"are":[58,121,142],"characterized":[59],"among":[60],"solutions":[62],"to":[63,80,87,164],"family":[65],"generated":[68],"when":[69,100,113],"vector":[71],"$(q_1":[72],",q_2":[73],",":[74],",q_d":[76],")$":[77],"allowed":[79],"range":[81],"over":[82],"all":[83],"values":[84],"sum":[86],"n.":[88],"fast":[90],"algorithm":[91],"given":[93,122,143],"solving":[95],"such":[96],"d":[101],"small.":[103],"characterization":[105],"presented":[107],"how":[109],"solution":[111,126],"changes":[112,116],"cost.":[118],"Data":[119],"structures":[120],"updating":[124],"on-line":[127],"time":[129],"an":[133],"arbitrary":[134],"modified.":[138],"Efficient":[139],"update":[140],"algorithms":[141],"maintaining":[145],"color-constrained":[147],"minimum":[148,170],"spanning":[149,171],"tree":[150,172],"either":[152],"general":[154],"or":[155],"planar":[157],"graph.":[158],"An":[159],"application":[160],"techniques":[163],"problem":[166],"finding":[168],"with":[173],"several":[174],"degree-constrained":[175],"vertices":[176],"described.":[178]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}