On the public citation graph

A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs

0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02253613openalex-snapshot
Hamiltonicity in graphs with fewP 4's
inferredcites →https://doi.org/10.1016/0012-365x(93)90223-gopenalex-snapshot
Paths in interval graphs and circular arc graphs
inferredcites →https://doi.org/10.1016/0020-0190(90)90064-5openalex-snapshot
Linear algorithm for optimal path cover problem on interval graphs
inferredcites →https://doi.org/10.1016/0095-8956(78)90013-8openalex-snapshot
On a class of posets and the corresponding comparability graphs
inferredcites →https://doi.org/10.1016/0166-218x(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0166-218x(84)90088-xopenalex-snapshot
Clustering and domination in perfect graphs
inferredcites →https://doi.org/10.1016/0304-3975(93)90123-bopenalex-snapshot
Optimal path cover problem on block graphs and bipartite permutation graphs
inferredcites →https://doi.org/10.1016/0898-1221(95)00139-popenalex-snapshot
An optimal path cover algorithm for cographs
inferredcites →https://doi.org/10.1016/j.dam.2005.07.002openalex-snapshot
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
inferredcites →https://doi.org/10.1016/j.dam.2005.07.012openalex-snapshot
The Hamiltonian problem on distance-hereditary graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2003.08.004openalex-snapshot
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2004.03.014openalex-snapshot
An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.04.009openalex-snapshot
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
inferredcites →https://doi.org/10.1016/s0012-365x(98)00319-7openalex-snapshot
Modular decomposition and transitive orientation
inferredcites →https://doi.org/10.1016/s0304-3975(02)00068-3openalex-snapshot
A time-optimal solution for the path cover problem on cographs
inferredcites →https://doi.org/10.1093/ietisy/e89-d.10.2600openalex-snapshot
Node-Disjoint Paths Algorithm in a Transposition Graph
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
inferredcites →https://doi.org/10.1137/1.9780898719796openalex-snapshot
Graph Classes: A Survey
inferredcites →https://doi.org/10.46298/dmtcs.232openalex-snapshot
On P_4-tidy graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_33openalex-snapshot
An Approximation Algorithm for Covering Vertices by $$4^+$$-Paths
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_10openalex-snapshot
Covering Vertices by $$4^+$$-Paths: A Simpler Local Search Coupled with a More Delicate Amortization
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_18openalex-snapshot
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_23openalex-snapshot
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_41openalex-snapshot
Approximately Covering Vertices by Order-5 or Longer Paths
inferred← citeshttps://doi.org/10.1007/s00453-009-9292-5openalex-snapshot
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
inferred← citeshttps://doi.org/10.1007/s00453-024-01242-3openalex-snapshot
Approximation Algorithms for Covering Vertices by Long Paths
inferred← citeshttps://doi.org/10.1007/s10878-021-00793-3openalex-snapshot
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
inferred← citeshttps://doi.org/10.1007/s10878-025-01279-2openalex-snapshot
An improved approximation algorithm for covering vertices by $$4^+$$-paths
inferred← citeshttps://doi.org/10.1007/s11786-009-0004-yopenalex-snapshot
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105378openalex-snapshot
Approximation algorithms for the maximum path cover problem using long paths
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103704openalex-snapshot
Approximately covering vertices by order-5 or longer paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.003openalex-snapshot
A polynomial solution to the k -fixed-endpoint path cover problem on proper interval graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115910openalex-snapshot
Covering and partitioning of split, chain and cographs with isometric paths
inferred← citeshttps://doi.org/10.1145/3711844openalex-snapshot
Computing Hamiltonian Paths with Partial Order Restrictions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.