{"id":"https://openalex.org/W2173807572","doi":"https://doi.org/10.1007/3-540-17218-1_59","title":"Applications of parallel scheduling to perfect graphs","display_name":"Applications of parallel scheduling to perfect graphs","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2173807572","doi":"https://doi.org/10.1007/3-540-17218-1_59","mag":"2173807572"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-17218-1_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-17218-1_59","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5014740431","display_name":"David P. Helmbold","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Helmbold","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109876781","display_name":"Ernst Mayr","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ernst Mayr","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"188","last_page":"203"},"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.9986000061035156,"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.9976000189781189,"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/computer-science","display_name":"Computer science","score":0.7040578126907349},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6787149310112},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.6666815876960754},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6618835926055908},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.635269284248352},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.5450263023376465},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5209004878997803},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5144281983375549},{"id":"https://openalex.org/keywords/trapezoid-graph","display_name":"Trapezoid graph","score":0.5129342079162598},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4855477511882782},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.47355666756629944},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47274506092071533},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.4564133286476135},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4444279670715332},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4227215349674225},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4158189594745636},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4114898145198822},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2998160421848297},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29557332396507263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26721706986427307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2602844536304474},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.20927110314369202},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17849799990653992},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13073992729187012}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7040578126907349},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6787149310112},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.6666815876960754},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6618835926055908},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.635269284248352},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.5450263023376465},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5209004878997803},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5144281983375549},{"id":"https://openalex.org/C10325715","wikidata":"https://www.wikidata.org/wiki/Q7835582","display_name":"Trapezoid graph","level":5,"score":0.5129342079162598},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4855477511882782},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.47355666756629944},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47274506092071533},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.4564133286476135},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4444279670715332},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4227215349674225},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4158189594745636},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4114898145198822},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2998160421848297},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29557332396507263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26721706986427307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2602844536304474},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.20927110314369202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17849799990653992},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13073992729187012}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-17218-1_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-17218-1_59","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:ADA172043","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA172043","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1531679293","https://openalex.org/W1556711032","https://openalex.org/W1655990431","https://openalex.org/W1808600260","https://openalex.org/W1973538756","https://openalex.org/W1975146994","https://openalex.org/W1979641885","https://openalex.org/W1980364701","https://openalex.org/W1982800484","https://openalex.org/W1996256520","https://openalex.org/W2004350101","https://openalex.org/W2004618348","https://openalex.org/W2008587336","https://openalex.org/W2026143151","https://openalex.org/W2030776771","https://openalex.org/W2033520777","https://openalex.org/W2057392949","https://openalex.org/W2060983467","https://openalex.org/W2063410295","https://openalex.org/W2071114738","https://openalex.org/W2092333800","https://openalex.org/W2143474538","https://openalex.org/W2288474359","https://openalex.org/W2320198223","https://openalex.org/W2343730655","https://openalex.org/W2610729871","https://openalex.org/W6637190722","https://openalex.org/W6680812728"],"related_works":["https://openalex.org/W2963089667","https://openalex.org/W2530575142","https://openalex.org/W2407211346","https://openalex.org/W3022455744","https://openalex.org/W1598023462","https://openalex.org/W1787922240","https://openalex.org/W2173807572","https://openalex.org/W2143081532","https://openalex.org/W199881157","https://openalex.org/W107447107"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}