LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
From MaRDI portal
(Redirected from Publication:2848201)
Recommendations
- Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- An optimal path cover algorithm for cographs
- An approximation algorithm for the minimum co-path set problem
- Complexity and approximability of minimum path-collection exact covers
- A new LBFS-based algorithm for cocomparability graph recognition
- On the minimum cycle cover problem on graphs with bounded co-degeneracy
- A time-optimal solution for the path cover problem on cographs.
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
- A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs
Cited in
(44)- Maximum induced matching algorithms via vertex ordering characterizations
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- Recognizing graph search trees
- Graph searches and their end vertices
- A simple linear time algorithm to solve the MIST problem on interval graphs
- The longest cycle problem is polynomial on interval graphs
- Nontrivial path covers of graphs: existence, minimization and maximization
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
- A simple certifying algorithm for 3-edge-connectivity
- On the power of graph searching for cocomparability graphs
- Vertex ordering characterizations of graphs of bounded asteroidal number
- End-vertices of graph search algorithms
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
- Linear time LexDFS on cocomparability graphs
- A new LBFS-based algorithm for cocomparability graph recognition
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- A simple polynomial algorithm for the longest path problem on cocomparability graphs
- The LexCycle on \(\overline{P_2\cup P_3} \)-free cocomparability graphs
- The recognition problem of graph search trees
- Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- Maximum induced matching algorithms via vertex ordering characterizations
- Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
- scientific article; zbMATH DE number 7651152 (Why is no real title available?)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency
- Parameterizing path partitions
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
- Graph Search Trees and Their Leaves
- Graphs with at most two moplexes
- Certifying induced subgraphs in large graphs
- Semi-proper interval graphs
- Parameterizing path partitions
- On the leaves of graph search trees
- Isometric path complexity of graphs
- On a variant of the minimum path cover problem in acyclic digraphs: computational complexity results and exact method
- The partial search order problem
- A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems
- Merging rules for strong structural controllability and minimum input problem in undirected networks
- Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth
- On the unit interval graphs which are paired k-disjoint path coverable
- Computing Hamiltonian paths with partial order restrictions
- Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
- Covering and partitioning of split, chain and cographs with isometric paths
- Cyclability in graph classes
- A tie-break model for graph search
This page was built for publication: LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848201)
