{"id":"https://openalex.org/W1972453585","doi":"https://doi.org/10.1007/s101070050040","title":"Increasing the rooted-connectivity of a digraph by one","display_name":"Increasing the rooted-connectivity of a digraph by one","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W1972453585","doi":"https://doi.org/10.1007/s101070050040","mag":"1972453585"},"language":"en","primary_location":{"id":"doi:10.1007/s101070050040","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050040","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5091492325","display_name":"Andr\u00e1s Frank","orcid":"https://orcid.org/0000-0001-6161-4848"},"institutions":[{"id":"https://openalex.org/I4210131589","display_name":"Ericsson (Hungary)","ror":"https://ror.org/03c0yyz21","country_code":"HU","type":"company","lineage":["https://openalex.org/I1306339040","https://openalex.org/I4210131589"]},{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Andr\u00e1s Frank","raw_affiliation_strings":["Department of Operations Research, E\u00f6tv\u00f6s University, R\u00e1k\u00f3czi \u00fat\u20095, Budapest, Hungary, H-1088 and Ericsson Traffic Laboratory, Laborc u.1, Budapest, Hungary, H-1037, e-mail: frank@cs.elte.hu., HU","Department of Operations Research, E\u00f6tv\u00f6s University, R\u00e1k\u00f3czi \u00fat\u20095, Budapest, Hungary, H-1088 and Ericsson Traffic Laboratory, Laborc u.1, Budapest, Hungary, H-1037, e-mail: frank@cs.elte.hu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, E\u00f6tv\u00f6s University, R\u00e1k\u00f3czi \u00fat\u20095, Budapest, Hungary, H-1088 and Ericsson Traffic Laboratory, Laborc u.1, Budapest, Hungary, H-1037, e-mail: frank@cs.elte.hu., HU","institution_ids":["https://openalex.org/I106118109","https://openalex.org/I4210131589"]},{"raw_affiliation_string":"Department of Operations Research, E\u00f6tv\u00f6s University, R\u00e1k\u00f3czi \u00fat\u20095, Budapest, Hungary, H-1088 and Ericsson Traffic Laboratory, Laborc u.1, Budapest, Hungary, H-1037, e-mail: frank@cs.elte.hu","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091492325"],"corresponding_institution_ids":["https://openalex.org/I106118109","https://openalex.org/I4210131589"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.9696,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.73481851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"84","issue":"3","first_page":"565","last_page":"576"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.991100013256073,"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.991100013256073,"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.9890999794006348,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9850000143051147,"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/digraph","display_name":"Digraph","score":0.9317751526832581},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7358745336532593},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7047053575515747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6665372848510742},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6149381399154663},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5529829263687134},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5441400408744812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5142945647239685},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4317835569381714},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.4213825464248657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3586149215698242},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3312781751155853},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32241347432136536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2835606634616852},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07740166783332825}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9317751526832581},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7358745336532593},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7047053575515747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6665372848510742},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6149381399154663},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5529829263687134},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5441400408744812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5142945647239685},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4317835569381714},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.4213825464248657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3586149215698242},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3312781751155853},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32241347432136536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2835606634616852},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07740166783332825},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s101070050040","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050040","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.5109","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.elte.hu/~frank/pub/MOHO.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1576820654","https://openalex.org/W2072711102","https://openalex.org/W2084278031","https://openalex.org/W2255467360"],"related_works":["https://openalex.org/W2402949237","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W3204684126","https://openalex.org/W2735578456","https://openalex.org/W4389478405","https://openalex.org/W2963059222","https://openalex.org/W1964613426","https://openalex.org/W2901206941","https://openalex.org/W2968699064"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}