{"id":"https://openalex.org/W1514528434","doi":"https://doi.org/10.1007/bfb0040382","title":"Computing a perfect matching in a line graph","display_name":"Computing a perfect matching in a line graph","publication_year":2006,"publication_date":"2006-08-02","ids":{"openalex":"https://openalex.org/W1514528434","doi":"https://doi.org/10.1007/bfb0040382","mag":"1514528434"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0040382","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0040382","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]},{"id":"https://openalex.org/I2800817003","display_name":"California Southern University","ror":"https://ror.org/058zz0t50","country_code":"US","type":"education","lineage":["https://openalex.org/I2800817003"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph Naor","raw_affiliation_strings":["Department of Computer Science, University of Southern California, Los Angeles","University of Southern California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California, Los Angeles","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"University of Southern California","institution_ids":["https://openalex.org/I1174212","https://openalex.org/I2800817003"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025400832"],"corresponding_institution_ids":["https://openalex.org/I1174212","https://openalex.org/I2800817003"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.04190539,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/line-graph","display_name":"Line graph","score":0.7467385530471802},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6753231287002563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5253604650497437},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5160638689994812},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.48932236433029175},{"id":"https://openalex.org/keywords/perfect-graph-theorem","display_name":"Perfect graph theorem","score":0.48866012692451477},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.4811881184577942},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47422242164611816},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4596526026725769},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4357469975948334},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.4303331971168518},{"id":"https://openalex.org/keywords/trivially-perfect-graph","display_name":"Trivially perfect graph","score":0.4177766442298889},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.3749319612979889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3679884076118469},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10031959414482117}],"concepts":[{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.7467385530471802},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6753231287002563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5253604650497437},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5160638689994812},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48932236433029175},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.48866012692451477},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.4811881184577942},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47422242164611816},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4596526026725769},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4357469975948334},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.4303331971168518},{"id":"https://openalex.org/C170903109","wikidata":"https://www.wikidata.org/wiki/Q7844666","display_name":"Trivially perfect graph","level":5,"score":0.4177766442298889},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3749319612979889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3679884076118469},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10031959414482117},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bfb0040382","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0040382","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W300448282","https://openalex.org/W1603095026","https://openalex.org/W1981234161","https://openalex.org/W2057950320","https://openalex.org/W2065251841","https://openalex.org/W2068986553","https://openalex.org/W2100061495","https://openalex.org/W2153746396","https://openalex.org/W2335389215","https://openalex.org/W2610479830","https://openalex.org/W2610729871"],"related_works":["https://openalex.org/W2105838663","https://openalex.org/W3020996517","https://openalex.org/W1025829657","https://openalex.org/W2174595530","https://openalex.org/W2401632469","https://openalex.org/W1988932361","https://openalex.org/W2509813159","https://openalex.org/W3021689243","https://openalex.org/W1845827952","https://openalex.org/W4289096735"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}