{"id":"https://openalex.org/W2583364872","doi":"https://doi.org/10.1007/978-3-319-53007-9_27","title":"Induced Matching in Some Subclasses of Bipartite Graphs","display_name":"Induced Matching in Some Subclasses of Bipartite Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2583364872","doi":"https://doi.org/10.1007/978-3-319-53007-9_27","mag":"2583364872"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53007-9_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53007-9_27","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":"book-chapter","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/A5008031846","display_name":"Arti Pandey","orcid":"https://orcid.org/0000-0002-1242-7808"},"institutions":[{"id":"https://openalex.org/I119241673","display_name":"Indian Institute of Technology Ropar","ror":"https://ror.org/02qkhhn56","country_code":"IN","type":"education","lineage":["https://openalex.org/I119241673"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Arti Pandey","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Ropar, Nangal Road, Rupnagar, 140001, Punjab, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Ropar, Nangal Road, Rupnagar, 140001, Punjab, India","institution_ids":["https://openalex.org/I119241673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061095539","display_name":"B. S. Panda","orcid":"https://orcid.org/0000-0002-0721-5325"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. S. Panda","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058990376","display_name":"Piyush Dane","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Piyush Dane","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024031063","display_name":"Manav Kashyap","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Manav Kashyap","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008031846"],"corresponding_institution_ids":["https://openalex.org/I119241673"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.136,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85329284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"308","last_page":"319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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.9980999827384949,"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.9828000068664551,"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.9696999788284302,"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/bipartite-graph","display_name":"Bipartite graph","score":0.9066956639289856},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8753964900970459},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.6570789217948914},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6524602770805359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6125036478042603},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.5151951909065247},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4772194027900696},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4681186079978943},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.46325287222862244},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4601844251155853},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4477086067199707},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4469630718231201},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4220483899116516},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.39407777786254883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2720349431037903},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.22490796446800232},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21803489327430725},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08765992522239685}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9066956639289856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8753964900970459},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.6570789217948914},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6524602770805359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6125036478042603},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.5151951909065247},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4772194027900696},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4681186079978943},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.46325287222862244},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4601844251155853},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4477086067199707},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4469630718231201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4220483899116516},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.39407777786254883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2720349431037903},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.22490796446800232},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21803489327430725},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08765992522239685},{"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/978-3-319-53007-9_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53007-9_27","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":[{"display_name":"Peace, Justice and strong institutions","score":0.550000011920929,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W165018185","https://openalex.org/W213040184","https://openalex.org/W1886615367","https://openalex.org/W1974366154","https://openalex.org/W1974918981","https://openalex.org/W1977889556","https://openalex.org/W1991742112","https://openalex.org/W2001053859","https://openalex.org/W2015698277","https://openalex.org/W2032987509","https://openalex.org/W2041875351","https://openalex.org/W2058511514","https://openalex.org/W2068155033","https://openalex.org/W2079887842","https://openalex.org/W2111516132","https://openalex.org/W2145337305","https://openalex.org/W2154658620","https://openalex.org/W2164675585","https://openalex.org/W2252286593","https://openalex.org/W4210377846"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2352066879","https://openalex.org/W2949886028","https://openalex.org/W4226093346","https://openalex.org/W2184969544","https://openalex.org/W4232683556","https://openalex.org/W4320022211","https://openalex.org/W2998365184","https://openalex.org/W2071364952","https://openalex.org/W2366256543"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}