{"id":"https://openalex.org/W1986137691","doi":"https://doi.org/10.1137/11083856x","title":"LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs","display_name":"LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1986137691","doi":"https://doi.org/10.1137/11083856x","mag":"1986137691"},"language":"en","primary_location":{"id":"doi:10.1137/11083856x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11083856x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5055875227","display_name":"Derek G. Corneil","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Derek G. Corneil","raw_affiliation_strings":["DCS - Department of Computer Science [University of Toronto] (40 St. George Street, Toronto, Ontario M5S 2E4 - Canada)"],"affiliations":[{"raw_affiliation_string":"DCS - Department of Computer Science [University of Toronto] (40 St. George Street, Toronto, Ontario M5S 2E4 - Canada)","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027471365","display_name":"Barnaby Dalton","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Barnaby Dalton","raw_affiliation_strings":["DCS - Department of Computer Science [University of Toronto] (40 St. George Street, Toronto, Ontario M5S 2E4 - Canada)"],"affiliations":[{"raw_affiliation_string":"DCS - Department of Computer Science [University of Toronto] (40 St. George Street, Toronto, Ontario M5S 2E4 - Canada)","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022152674","display_name":"Michel Habib","orcid":"https://orcid.org/0000-0002-8564-2314"},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michel Habib","raw_affiliation_strings":["LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications (Universit\u00e9 Paris Diderot, B\u00e2t. Sophie Germain, case postale 7014, 75205 Paris cedex 13 - France)","GANG - Networks, Graphs and Algorithms (France)"],"affiliations":[{"raw_affiliation_string":"LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications (Universit\u00e9 Paris Diderot, B\u00e2t. Sophie Germain, case postale 7014, 75205 Paris cedex 13 - France)","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115"]},{"raw_affiliation_string":"GANG - Networks, Graphs and Algorithms (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055875227"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":6.5257,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.96933853,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"42","issue":"3","first_page":"792","last_page":"807"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9969000220298767,"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.9836999773979187,"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.7829572558403015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6440854072570801},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5317389369010925},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4956308603286743},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4891217350959778},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.48378893733024597},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4823252856731415},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.48196670413017273},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.47041016817092896},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.46983644366264343},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45004189014434814},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.43812304735183716},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.43013450503349304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4282471835613251},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30940037965774536},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22880104184150696},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19503530859947205}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7829572558403015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6440854072570801},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5317389369010925},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4956308603286743},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4891217350959778},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.48378893733024597},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4823252856731415},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.48196670413017273},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.47041016817092896},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.46983644366264343},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45004189014434814},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.43812304735183716},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.43013450503349304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4282471835613251},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30940037965774536},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22880104184150696},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19503530859947205}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/11083856x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11083856x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00936300v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00936300","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2013, 42 (3), pp.792-807. ⟨10.1137/11083856X⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W55887128","https://openalex.org/W1813313303","https://openalex.org/W1975099798","https://openalex.org/W1978041641","https://openalex.org/W1996256520","https://openalex.org/W1998389851","https://openalex.org/W2015475193","https://openalex.org/W2028503265","https://openalex.org/W2033410225","https://openalex.org/W2043793831","https://openalex.org/W2054496228","https://openalex.org/W2055745794","https://openalex.org/W2069133957","https://openalex.org/W2072762499","https://openalex.org/W2080222130","https://openalex.org/W2086119402","https://openalex.org/W2088579252","https://openalex.org/W2089894925","https://openalex.org/W2106934213","https://openalex.org/W2119014043","https://openalex.org/W2170633983","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W1787922240","https://openalex.org/W2788975631","https://openalex.org/W2963009577","https://openalex.org/W2903402681","https://openalex.org/W2530575142","https://openalex.org/W2016277208","https://openalex.org/W4283803822","https://openalex.org/W2950872944","https://openalex.org/W2966902162","https://openalex.org/W2125939925"],"abstract_inverted_index":{"For":[0],"graph":[1,85,190],"$G(V,E)$,":[2],"a":[3,9,36,61,98,113,194,200],"minimum":[4,10],"path":[5,29,42],"cover":[6,18],"(MPC)":[7],"is":[8,25,35,97,103,112,185,210,225],"cardinality":[11],"set":[12],"of":[13,23,39,48,56,65,73,91,94,110,116,123,144,222],"vertex":[14,22],"disjoint":[15],"paths":[16],"that":[17,50,68,107,118,134],"$V$":[19],"(i.e.,":[20,132],"every":[21,83],"$G$":[24,86,111],"in":[26,30],"exactly":[27],"one":[28],"the":[31,40,92,120,163,174,213,223,233],"cover).":[32],"This":[33],"problem":[34],"natural":[37],"generalization":[38],"Hamiltonian":[41],"problem.":[43],"Cocomparability":[44],"graphs":[45,49,67,74,157],"(the":[46],"complements":[47],"have":[51,159],"an":[52,108],"acyclic":[53,88],"transitive":[54,89],"orientation":[55,90],"their":[57],"edge":[58],"sets)":[59],"are":[60,127],"well":[62],"studied":[63],"subfamily":[64],"perfect":[66],"includes":[69],"many":[70],"popular":[71],"families":[72],"such":[75],"as":[76],"interval,":[77],"permutation,":[78],"and":[79,87],"cographs.":[80],"Furthermore,":[81],"for":[82,141,155,167,180,199,216],"cocomparability":[84,145,156,181],"edges":[93],"$\\overline{G}$":[95],"there":[96,126],"corresponding":[99,214],"poset":[100,139],"$P_G$;":[101],"it":[102],"easy":[104],"to":[105,212],"see":[106],"MPC":[109,130,153,178],"linear":[114],"extension":[115],"$P_G$":[117],"minimizes":[119],"bump":[121,164],"number":[122,165],"$P_G$.":[124],"Although":[125],"directly":[128,176],"graph-theoretical":[129,177],"algorithms":[131,133,154,166],"do":[135],"not":[136],"rely":[137],"on":[138,162,187],"formulations)":[140],"various":[142],"subfamilies":[143],"graphs,":[146,149],"notably":[147],"interval":[148,217],"until":[150],"now":[151],"all":[152],"themselves":[158],"been":[160],"based":[161,186],"posets.":[168],"In":[169],"this":[170,183,208],"paper":[171],"we":[172],"present":[173],"first":[175,203],"algorithm":[179,184,209,215,224],"graphs;":[182],"two":[188],"consecutive":[189],"searches":[191],"followed":[192],"by":[193],"certifying":[195],"algorithm.":[196],"Surprisingly,":[197],"except":[198],"lexicographic":[201],"depth":[202],"search":[204],"(LDFS)":[205],"preprocessing":[206],"step,":[207],"identical":[211],"graphs.":[218],"The":[219],"running":[220],"time":[221],"$O({\\rm":[226],"min}(n^2,":[227],"n":[228],"+":[229],"{\\rm":[230],"mloglogn}))$,":[231],"with":[232],"nonlinearity":[234],"coming":[235],"from":[236],"LDFS.":[237]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}