{"id":"https://openalex.org/W2111523610","doi":"https://doi.org/10.1080/00207169608804486","title":"A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs","display_name":"A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2111523610","doi":"https://doi.org/10.1080/00207169608804486","mag":"2111523610"},"language":"en","primary_location":{"id":"doi:10.1080/00207169608804486","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169608804486","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer 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/A5039205000","display_name":"Madhumangal Pal","orcid":"https://orcid.org/0000-0002-6709-836X"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Madhumangal Pal","raw_affiliation_strings":["\n                   \n               Department of Mathematics, Indian Institute of Technology, Kharagpur, 721 302, India","Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Mathematics, Indian Institute of Technology, Kharagpur, 721 302, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041997137","display_name":"G. P. Bhattacharjee","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G. P. Bhattacharjee","raw_affiliation_strings":["\n                   \n               Department of Mathematics, Indian Institute of Technology, Kharagpur, 721 302, India","Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Mathematics, Indian Institute of Technology, Kharagpur, 721 302, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039205000"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.5316,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.74753116,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"60","issue":"3-4","first_page":"205","last_page":"214"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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.9968000054359436,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9926000237464905,"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/mathematics","display_name":"Mathematics","score":0.8208224773406982},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7220098972320557},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.7174354791641235},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6130159497261047},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5511934757232666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5121619701385498},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47216886281967163},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4680134057998657},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4617052674293518},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4572874903678894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45375725626945496},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.23071810603141785},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1472983956336975}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8208224773406982},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7220098972320557},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.7174354791641235},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6130159497261047},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5511934757232666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5121619701385498},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47216886281967163},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4680134057998657},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4617052674293518},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4572874903678894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45375725626945496},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.23071810603141785},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1472983956336975}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169608804486","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169608804486","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1513353427","https://openalex.org/W1979977220","https://openalex.org/W2006001074","https://openalex.org/W2011039300","https://openalex.org/W2062221600","https://openalex.org/W2063410295","https://openalex.org/W2089465933","https://openalex.org/W2128873679","https://openalex.org/W2143474538","https://openalex.org/W2149342630","https://openalex.org/W2160365857","https://openalex.org/W2170359320","https://openalex.org/W4232336108","https://openalex.org/W4299866835","https://openalex.org/W4361867857"],"related_works":["https://openalex.org/W3123958729","https://openalex.org/W2011576340","https://openalex.org/W2970277130","https://openalex.org/W2803082133","https://openalex.org/W3163147688","https://openalex.org/W2187700168","https://openalex.org/W2296729072","https://openalex.org/W2128873679","https://openalex.org/W4286907398","https://openalex.org/W3101862638"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,76],"paper":[3],"an":[4,19,85],"O(kn\u221alogc+\u03b3)":[5],"time":[6,65,69],"algorithm":[7,77,104],"is":[8,31,44,71],"presented":[9],"to":[10],"solve":[11],"the":[12,32,35,39,45,57,64,68,78],"maximum":[13,79],"weight":[14,33,80],"k-independent":[15],"set":[16,82,107],"problem":[17,83,108],"on":[18],"interval":[20,40,54,86],"graph":[21,41,87],"with":[22,88],"n":[23,89],"vertices":[24,90],"and":[25,42],"non-negative":[26],"integer":[27],"weights,":[28],"where":[29],"c":[30],"of":[34,38,48,72,120,122],"longest":[36],"path":[37],"\u03b3":[43],"total":[46],"size":[47],"all":[49],"maximal":[50],"cliques,":[51],"given":[52],"its":[53],"representation.":[55],"If":[56],"intervals":[58],"are":[59],"not":[60],"sorted":[61],"then":[62],"considering":[63],"for":[66,84,105],"sorting":[67],"complexity":[70],"O(nlogn+kn":[73],"\u221alogc+\u03b3).":[74],"Using":[75],"2-independent":[81,106],"can":[91],"be":[92],"solved":[93],"in":[94],"O(n":[95,110],"\u221alogc":[96],"+":[97],"\u03b3)":[98],"time.":[99,112],"The":[100],"best":[101],"known":[102],"previous":[103],"requires":[109],"2)":[111],"Keywords:":[113],"Interval":[114],"graphIndependent":[115],"setNetwork":[116],"flow":[117],"problemCombinatorial":[118],"problemsDesign":[119],"algorithmsAnalysis":[121],"algorithmsC.R.Categories:":[123],"E.1F.2G.2.2I.1.2.":[124]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}