{"id":"https://openalex.org/W7095791996","doi":null,"title":"J.-S. Sereni Matchings in Graphs 11/2009","display_name":"J.-S. Sereni Matchings in Graphs 11/2009","publication_year":2015,"publication_date":"2015-08-23","ids":{"openalex":"https://openalex.org/W7095791996"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.621.8699","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.621.8699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.univ-paris-diderot.fr/~sereni/Lectures/AG_Fall09/ag09_1.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40645094,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4088999927043915,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4088999927043915,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.2858999967575073,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.20909999310970306,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching-theory","display_name":"matching theory","score":0.8119999766349792},{"id":"https://openalex.org/keywords/maximum-matching","display_name":"maximum matching","score":0.7760000228881836},{"id":"https://openalex.org/keywords/edmonds-algorithm","display_name":"Edmonds' algorithm","score":0.7379999756813049},{"id":"https://openalex.org/keywords/efficient-algorithms","display_name":"efficient algorithms","score":0.5040000081062317},{"id":"https://openalex.org/keywords/graph-theory","display_name":"graph theory","score":0.6549999713897705}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5472000241279602},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49810001254081726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4284999966621399},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.41780000925064087},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.414000004529953},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39419999718666077},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.34880000352859497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3425000011920929},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.3377000093460083},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.3257000148296356},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3142000138759613},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3075000047683716},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2800999879837036},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2766000032424927},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.263700008392334}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.621.8699","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.621.8699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.univ-paris-diderot.fr/~sereni/Lectures/AG_Fall09/ag09_1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7096108620","https://openalex.org/W4205585695","https://openalex.org/W7018866978","https://openalex.org/W4233756358","https://openalex.org/W2207162563","https://openalex.org/W33801284","https://openalex.org/W4255607566","https://openalex.org/W4231636295","https://openalex.org/W4254890067","https://openalex.org/W2778400415"],"abstract_inverted_index":{"Matching":[0],"theory":[1],"is":[2,14,38],"a":[3,39,51],"core":[4],"topic":[5],"of":[6,16,41],"both":[7],"applied":[8],"and":[9,18],"theoretical":[10,53],"graph":[11,43,52],"theory,":[12,44],"which":[13],"full":[15],"elegant":[17],"deep":[19],"results.":[20],"In":[21],"1965,":[22],"Edmonds":[23],"[1]":[24],"gave":[25],"the":[26,46],"first":[27,47],"efficient":[28,48],"algorithm":[29,49],"to":[30],"find":[31],"maximum":[32],"matchings":[33],"in":[34],"graphs.":[35],"His":[36],"result":[37],"milestone":[40],"algorithmic":[42],"providing":[45],"for":[50],"problem":[54],"that":[55]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-27T00:00:00"}