{"id":"https://openalex.org/W2022621426","doi":"https://doi.org/10.1137/110846725","title":"Algorithms for Finding a Maximum Non-<i>k</i>-Linked Graph","display_name":"Algorithms for Finding a Maximum Non-<i>k</i>-Linked Graph","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2022621426","doi":"https://doi.org/10.1137/110846725","mag":"2022621426"},"language":"en","primary_location":{"id":"doi:10.1137/110846725","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110846725","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5074548000","display_name":"Yusuke Kobayashi","orcid":"https://orcid.org/0000-0001-9478-7307"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yusuke Kobayashi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"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":1,"citation_normalized_percentile":{"value":0.10377392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"26","issue":"2","first_page":"591","last_page":"604"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/combinatorics","display_name":"Combinatorics","score":0.8253082036972046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.696824312210083},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5502514839172363},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5457519888877869},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5181971192359924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5090698599815369},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4803967773914337},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.42816802859306335},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.41786989569664}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8253082036972046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.696824312210083},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5502514839172363},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5457519888877869},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5181971192359924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5090698599815369},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4803967773914337},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.42816802859306335},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.41786989569664}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110846725","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110846725","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8326857615","display_name":"Using dual concepts in graph minor algorithms","funder_award_id":"24700004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1969919767","https://openalex.org/W1976285925","https://openalex.org/W1994333286","https://openalex.org/W1996975178","https://openalex.org/W2005079828","https://openalex.org/W2009349792","https://openalex.org/W2012945739","https://openalex.org/W2019624146","https://openalex.org/W2054740829","https://openalex.org/W2059563583","https://openalex.org/W2063554572","https://openalex.org/W2087038119","https://openalex.org/W2098792571","https://openalex.org/W2111635834","https://openalex.org/W2115589427","https://openalex.org/W2122076180","https://openalex.org/W2128077580","https://openalex.org/W2323792666","https://openalex.org/W2381070482","https://openalex.org/W2569646339","https://openalex.org/W4213060883","https://openalex.org/W4234791693","https://openalex.org/W4238667556","https://openalex.org/W4252995166"],"related_works":["https://openalex.org/W2143345456","https://openalex.org/W2143551613","https://openalex.org/W4245395944","https://openalex.org/W1971174658","https://openalex.org/W1979740464","https://openalex.org/W2138823233","https://openalex.org/W2023236823","https://openalex.org/W1572263176","https://openalex.org/W2132777284","https://openalex.org/W1999473833"],"abstract_inverted_index":{"A":[0],"graph":[1,55],"with":[2],"at":[3],"least":[4],"$2k$":[5,28],"vertices":[6],"is":[7,70,75,89,128],"said":[8],"to":[9,92,115],"be":[10],"k-linked":[11],"if":[12],"for":[13,47,106],"any":[14],"two":[15],"ordered":[16],"k-tuples":[17],"$(s_1,":[18],"\\dots":[19,24,37,49],",":[20,25,38,50],"s_k)$":[21],"and":[22,45,82,87,152],"$(t_1,":[23],"t_k)$":[26],"of":[27,61,67,79,85,95,109,133,148],"distinct":[29],"vertices,":[30],"there":[31],"exist":[32],"pairwise":[33],"vertex-disjoint":[34],"paths":[35,123],"$P_1,":[36],"P_k$":[39],"such":[40],"that":[41,69],"$P_i$":[42],"connects":[43],"$s_i$":[44],"$t_i$":[46],"$i=1,":[48],"k$.":[51],"For":[52,130],"a":[53,63,76,112,117],"given":[54],"G,":[56,86],"we":[57,100,136],"consider":[58],"the":[59,93,102,107,131,145,149,153],"problem":[60,74,114],"finding":[62],"maximum":[64,118],"induced":[65,119],"subgraph":[66,120],"G":[68],"not":[71],"k-linked.":[72],"This":[73],"common":[77],"generalization":[78],"computing":[80],"vertex-connectivity":[81],"testing":[83],"k-linkedness":[84],"it":[88],"closely":[90],"related":[91],"concept":[94],"H-linkedness.":[96],"In":[97],"this":[98],"paper,":[99],"give":[101,137],"first":[103],"polynomial-time":[104],"algorithm":[105],"case":[108,132,151],"$k=2$,":[110],"whereas":[111],"similar":[113],"find":[116],"without":[121],"2-vertex-disjoint":[122],"connecting":[124],"fixed":[125],"terminal":[126],"pairs":[127],"NP-hard.":[129],"general":[134],"k,":[135],"an":[138],"$(8k-2)$-additive":[139],"approximation":[140],"algorithm.":[141],"We":[142],"also":[143],"investigate":[144],"computational":[146],"complexity":[147],"edge-disjoint":[150],"directed":[154],"case.":[155]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}