Pages that link to "Item:Q4972678"

The following pages link to Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678):

Displaying 29 items.

• Eccentricity function in distance-hereditary graphs (Q784475) (← links)
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← 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)
• Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
• On the tree-depth and tree-width in heterogeneous random graphs (Q2102520) (← links)
• Eccentricity queries and beyond using hub labels (Q2166770) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
• Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
• Computing Graph Polynomials on Graphs of Bounded Clique-Width (Q3522957) (← links)
• (Q4448752) (← links)
• (Q4608071) (← links)
• Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
• Parameterized complexity of diameter (Q5925618) (← links)
• The diameter of AT‐free graphs (Q6057658) (← links)
• Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
• A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• Computing maximum matchings in temporal graphs (Q6168321) (← links)
• \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
• Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
• Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
• Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
• A fixed-parameter algorithm for dominance drawings of DAGs (Q6634372) (← links)
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)