Pages that link to "Item:Q2848201"

The following pages link to LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs (Q2848201):

Displaying 31 items.

• A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
• A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
• Cyclability in graph classes (Q833007) (← links)
• A tie-break model for graph search (Q896657) (← links)
• A new graph parameter to measure linearity (Q1708605) (← links)
• Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
• A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
• Recognizing graph search trees (Q2132337) (← links)
• Graph searches and their end vertices (Q2165035) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
• A simple certifying algorithm for 3-edge-connectivity (Q2689444) (← links)
• On the power of graph searching for cocomparability graphs (Q2801333) (← links)
• Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
• End-Vertices of Graph Search Algorithms (Q2947028) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs (Q4899036) (← links)
• The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs (Q4987262) (← links)
• The Recognition Problem of Graph Search Trees (Q4997136) (← links)
• Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (Q4997325) (← links)
• Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• (Q5874479) (← links)
• On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
• Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
• Graphs with at most two moplexes (Q6595515) (← links)
• Certifying induced subgraphs in large graphs (Q6636998) (← links)
• Semi-proper interval graphs (Q6648246) (← links)
• Parameterizing path partitions (Q6664058) (← links)