Pages that link to "Item:Q2402262"

The following pages link to Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262):

Displaying 23 items.

• A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
• Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
• Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• The power of linear-time data reduction for maximum matching (Q2211355) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
• A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
• On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• (Q5091021) (← links)
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5091028) (← links)
• (Q5091230) (← links)
• Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
• The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5131226) (← links)
• Parameterized aspects of triangle enumeration (Q5915757) (← links)
• When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
• Parameterized complexity of diameter (Q5925618) (← links)
• Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• Computing maximum matchings in temporal graphs (Q6168321) (← links)
• Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)