{"id":"https://openalex.org/W1973229660","doi":"https://doi.org/10.3390/a8010046","title":"Recognition of Unipolar and Generalised Split Graphs","display_name":"Recognition of Unipolar and Generalised Split Graphs","publication_year":2015,"publication_date":"2015-02-13","ids":{"openalex":"https://openalex.org/W1973229660","doi":"https://doi.org/10.3390/a8010046","mag":"1973229660"},"language":"en","primary_location":{"id":"doi:10.3390/a8010046","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8010046","pdf_url":"https://www.mdpi.com/1999-4893/8/1/46/pdf?version=1423837896","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/8/1/46/pdf?version=1423837896","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111437501","display_name":"Colin McDiarmid","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Colin McDiarmid","raw_affiliation_strings":["Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084184369","display_name":"Nikola Yolov","orcid":"https://orcid.org/0000-0003-3118-1900"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nikola Yolov","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford OX 13QD, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford OX 13QD, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111437501"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.8169,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85602563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":"1","first_page":"46","last_page":"59"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9944000244140625,"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.7052793502807617},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6899449825286865},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6381788849830627},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5603910088539124},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.5257661938667297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5088567733764648},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.47271865606307983},{"id":"https://openalex.org/keywords/clique-number","display_name":"Clique number","score":0.4693889021873474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.459150493144989},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.45614999532699585},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.45159077644348145},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.438186913728714},{"id":"https://openalex.org/keywords/simplex-graph","display_name":"Simplex graph","score":0.43648576736450195},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.40891212224960327},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3868711292743683},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32757148146629333},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.30180758237838745},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1719989776611328}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7052793502807617},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6899449825286865},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6381788849830627},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5603910088539124},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.5257661938667297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5088567733764648},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.47271865606307983},{"id":"https://openalex.org/C2985491264","wikidata":"https://www.wikidata.org/wiki/Q761631","display_name":"Clique number","level":3,"score":0.4693889021873474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.459150493144989},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.45614999532699585},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.45159077644348145},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.438186913728714},{"id":"https://openalex.org/C202183611","wikidata":"https://www.wikidata.org/wiki/Q7520883","display_name":"Simplex graph","level":5,"score":0.43648576736450195},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.40891212224960327},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3868711292743683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32757148146629333},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.30180758237838745},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1719989776611328}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a8010046","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8010046","pdf_url":"https://www.mdpi.com/1999-4893/8/1/46/pdf?version=1423837896","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:342a351cb4294b0e93e6f551e8ddf8f3","is_oa":true,"landing_page_url":"https://doaj.org/article/342a351cb4294b0e93e6f551e8ddf8f3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 8, Iss 1, Pp 46-59 (2015)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/8/1/46/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a8010046","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a8010046","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8010046","pdf_url":"https://www.mdpi.com/1999-4893/8/1/46/pdf?version=1423837896","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1970348285","https://openalex.org/W1982050567","https://openalex.org/W1991728994","https://openalex.org/W2003160050","https://openalex.org/W2031823362","https://openalex.org/W2082242399","https://openalex.org/W2110033737","https://openalex.org/W2137272630"],"related_works":["https://openalex.org/W4213050588","https://openalex.org/W2133128623","https://openalex.org/W1783742161","https://openalex.org/W2186006531","https://openalex.org/W197594294","https://openalex.org/W2135966061","https://openalex.org/W1993482781","https://openalex.org/W4234564009","https://openalex.org/W1996059007","https://openalex.org/W2067182946"],"abstract_inverted_index":{"A":[0,33],"graph":[1,20,25,38],"is":[2,21,31],"unipolar":[3,34],"if":[4,26],"it":[5,27],"can":[6,39],"be":[7,40],"partitioned":[8],"into":[9],"a":[10,13,19,22,37],"clique":[11,46],"and":[12,18,54],"disjoint":[14],"union":[15],"of":[16,36,72],"cliques,":[17],"generalised":[23,74],"split":[24,75],"or":[28],"its":[29],"complement":[30],"unipolar.":[32],"partition":[35],"used":[41],"to":[42,55],"find":[43],"efficiently":[44],"the":[45,48,51],"number,":[47,50,53],"stability":[49],"chromatic":[52],"solve":[56],"other":[57],"problems":[58],"that":[59],"are":[60],"hard":[61],"for":[62,70],"general":[63],"graphs.":[64],"We":[65],"present":[66],"an":[67],"O(n2)-time":[68],"algorithm":[69],"recognition":[71],"n-vertex":[73],"graphs,":[76],"improving":[77],"on":[78],"previous":[79],"O(n3)-time":[80],"algorithms.":[81]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}