{"id":"https://openalex.org/W151506147","doi":null,"title":"Maximum cliques and vertex colorings in random and k-partite graphs","display_name":"Maximum cliques and vertex colorings in random and k-partite graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W151506147","mag":"151506147"},"language":"en","primary_location":{"id":"pmh:oai:https://spectrum.library.concordia.ca:1290","doi":null,"is_oa":false,"landing_page_url":"https://spectrum.library.concordia.ca/id/eprint/1290/1/MQ59327.pdf","pdf_url":"https://spectrum.library.concordia.ca/id/eprint/1290/1/MQ59327.pdf","source":{"id":"https://openalex.org/S4306400871","display_name":"Spectrum Research Repository (Concordia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I60158472","host_organization_name":"Concordia University","host_organization_lineage":["https://openalex.org/I60158472"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Graduate Projects (Non-thesis)"},"volume":null,"type":"dissertation","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Thomas J.R. Hughes","orcid":"https://orcid.org/0000-0001-7024-8368","observed_orcids":["https://orcid.org/0000-0001-7024-8368"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thomas J.R. Hughes","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7024-8368","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.37770000100135803,"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.37770000100135803,"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.27219998836517334,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.26440000534057617,"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/maximum-clique-problem","display_name":"maximum clique problem","score":0.7630000114440918},{"id":"https://openalex.org/keywords/vertex-coloring","display_name":"vertex coloring","score":0.925000011920929},{"id":"https://openalex.org/keywords/random-graphs","display_name":"random graphs","score":0.9829999804496765},{"id":"https://openalex.org/keywords/k-partite-graphs","display_name":"k-partite graphs","score":0.9150000214576721},{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.4189999997615814},{"id":"https://openalex.org/keywords/algorithm-efficiency-comparison","display_name":"algorithm efficiency comparison","score":0.41200000047683716}],"concepts":[{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.9252294301986694},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.8609210252761841},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.8155808448791504},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7143630385398865},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.668179452419281},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.657828688621521},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.634635329246521},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5734393000602722},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5690008401870728},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.5521867275238037},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47884678840637207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4495745897293091},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.41585880517959595},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37965643405914307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3424587845802307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2963964343070984},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.15435945987701416},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1369640827178955},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.08179163932800293},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.058195799589157104},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.053105950355529785}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:https://spectrum.library.concordia.ca:1290","doi":null,"is_oa":false,"landing_page_url":"https://spectrum.library.concordia.ca/id/eprint/1290/1/MQ59327.pdf","pdf_url":"https://spectrum.library.concordia.ca/id/eprint/1290/1/MQ59327.pdf","source":{"id":"https://openalex.org/S4306400871","display_name":"Spectrum Research Repository (Concordia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I60158472","host_organization_name":"Concordia University","host_organization_lineage":["https://openalex.org/I60158472"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Graduate Projects (Non-thesis)"},{"id":"pmh:oai:collectionscanada.gc.ca:OOAMICUS.26190006","doi":null,"is_oa":false,"landing_page_url":"http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59327.pdf","pdf_url":"http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59327.pdf","source":{"id":"https://openalex.org/S4306402307","display_name":"Library and Archives Canada (Government of Canada)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2802286613","host_organization_name":"Government of Canada","host_organization_lineage":["https://openalex.org/I2802286613"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Electronic thesis or dissertation"},{"id":"mag:151506147","doi":null,"is_oa":false,"landing_page_url":"https://spectrum.library.concordia.ca/id/eprint/1290/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2167036627","https://openalex.org/W2076193235","https://openalex.org/W2953031279","https://openalex.org/W2130881139","https://openalex.org/W6948080533","https://openalex.org/W1999360769","https://openalex.org/W1276703865","https://openalex.org/W1990516481","https://openalex.org/W7096236316","https://openalex.org/W7157128361"],"abstract_inverted_index":{"In":[0],"this":[1],"project":[2],"we":[3,62],"search":[4],"for":[5],"maximum":[6],"cliques":[7],"in":[8,68],"some":[9],"random":[10,13],"graphs":[11],"and":[12],"k-partite":[14],"graphs,":[15],"using":[16],"either":[17],"the":[18,23,32,35,40,43,51,57,73],"greedy":[19],"coloring":[20,25,59,74],"algorithm":[21,26,67],"or":[22],"Dsatur":[24],"as":[27,48,50],"bounding":[28],"functions.":[29],"We":[30],"compare":[31],"efficiency":[33],"of":[34,42,53],"algorithms":[36],"by":[37,56],"looking":[38],"at":[39],"sizes":[41],"resulting":[44],"state":[45],"space":[46],"trees,":[47],"well":[49],"number":[52],"colors":[54],"required":[55],"respective":[58],"algorithms.":[60,75],"Finally,":[61],"implement":[63],"a":[64],"bichromatic":[65],"interchange":[66],"an":[69],"attempt":[70],"to":[71],"improve":[72]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}