{"id":"https://openalex.org/W2146511660","doi":"https://doi.org/10.1142/s1793830910000693","title":"SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS","display_name":"SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2146511660","doi":"https://doi.org/10.1142/s1793830910000693","mag":"2146511660"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830910000693","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000693","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5015765462","display_name":"Rajiv Gandhi","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"RAJIV GANDHI","raw_affiliation_strings":["Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA","Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA#TAB#","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077149983","display_name":"Bradford Greening","orcid":"https://orcid.org/0000-0003-2727-2287"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"BRADFORD GREENING","raw_affiliation_strings":["Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA","Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Department of Computer Science, Rutgers University-Camden, Camden, NJ 08102, USA#TAB#","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013414239","display_name":"Sriram V. Pemmaraju","orcid":"https://orcid.org/0000-0002-0834-3476"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SRIRAM PEMMARAJU","raw_affiliation_strings":["Department of Computer Science, University of Iowa, Iowa City, IA 52242, USA","Department of Computer Science, University of Iowa, Iowa City, IA 52242, USA.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Iowa, Iowa City, IA 52242, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Department of Computer Science, University of Iowa, Iowa City, IA 52242, USA.#TAB#","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108123578","display_name":"Rajiv Raman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"RAJIV RAMAN","raw_affiliation_strings":["Max-Planck Institute for Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck Institute for Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3383,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.64812988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"02","issue":"03","first_page":"331","last_page":"345"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.994700014591217,"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.986299991607666,"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.821911096572876},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.7355581521987915},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.7314502596855164},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6760403513908386},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.6636025309562683},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.6556829214096069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6399226188659668},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6366750001907349},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5723778009414673},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5359210968017578},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.5154646039009094},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4783838987350464},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.44303134083747864},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4371952414512634},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4291345179080963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3329586684703827},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.27691733837127686},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2766224145889282},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11057820916175842}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.821911096572876},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.7355581521987915},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.7314502596855164},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6760403513908386},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.6636025309562683},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.6556829214096069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6399226188659668},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6366750001907349},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5723778009414673},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5359210968017578},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.5154646039009094},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4783838987350464},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.44303134083747864},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4371952414512634},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4291345179080963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3329586684703827},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.27691733837127686},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2766224145889282},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11057820916175842}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830910000693","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000693","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1964114184","https://openalex.org/W1978588354","https://openalex.org/W1998643836","https://openalex.org/W2003902428","https://openalex.org/W2011039300","https://openalex.org/W2034091599","https://openalex.org/W2052644051","https://openalex.org/W2074937107","https://openalex.org/W2112168774","https://openalex.org/W2117848356","https://openalex.org/W2132816737","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4297911588","https://openalex.org/W2793500002","https://openalex.org/W1542397451","https://openalex.org/W1842068753","https://openalex.org/W4296943582","https://openalex.org/W2585997002","https://openalex.org/W4212987857","https://openalex.org/W2175082514","https://openalex.org/W2111880533"],"abstract_inverted_index":{"In":[0,34,68],"this":[1,126],"paper,":[2],"we":[3,42,81,143],"study":[4],"the":[5,35,46,69,88,97,100,103,137,155],"sub-coloring":[6,36,133],"and":[7,20,23,76,124,150],"hypo-coloring":[8,70,138],"problems":[9,14],"on":[10,79,140],"interval":[11,134,141],"graphs.":[12,135],"These":[13],"have":[15],"applications":[16],"in":[17,66,106],"job":[18],"scheduling":[19],"distributed":[21],"computing":[22],"can":[24],"be":[25],"used":[26],"as":[27],"\"subroutines\"":[28],"for":[29,132,167],"other":[30],"combinatorial":[31],"optimization":[32],"problems.":[33],"problem,":[37,71,157],"given":[38,72],"a":[39,61,73,85,114,129],"graph":[40,74],"G,":[41,75],"want":[43,82],"to":[44,83,127,154,160],"partition":[45,86],"vertices":[47,89],"of":[48,53,63,87,90,99,102,118],"G":[49,91],"into":[50,92],"minimum":[51],"number":[52,122],"sub-color":[54,58,93,108],"classes,":[55],"where":[56],"each":[57,107],"class":[59,109],"induces":[60],"union":[62],"disjoint":[64],"cliques":[65,105],"G.":[67],"integral":[77],"weights":[78,101],"vertices,":[80],"find":[84],"classes":[94],"such":[95],"that":[96,146],"sum":[98],"heaviest":[104],"is":[110,148],"minimized.":[111],"We":[112],"present":[113],"\"forbidden":[115],"subgraph\"":[116],"characterization":[117],"graphs":[119],"with":[120],"sub-chromatic":[121],"k":[123],"use":[125],"derive":[128],"3-approximation":[130],"algorithm":[131,166],"For":[136],"problem":[139],"graphs,":[142],"first":[144],"show":[145,158],"it":[147],"NP-complete,":[149],"then":[151],"via":[152],"reduction":[153],"max-coloring":[156],"how":[159],"obtain":[161],"an":[162],"O(":[163],"log":[164],"n)-approximation":[165],"it.":[168]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}