Pages that link to "Item:Q3304140"
From MaRDI portal
The following pages link to On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140):
Displaying 16 items.
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm (Q2056889) (← 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)
- Eccentricity queries and beyond using hub labels (Q2166770) (← 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)
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth (Q4554362) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- (Q5091021) (← links)
- (Q5091230) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- On parameterized complexity of binary networked public goods game (Q6185945) (← links)
- On the size of minimal separators for treedepth decomposition (Q6558688) (← links)
- Effective data reduction for strongly stable matching in very sparse graphs (Q6663523) (← links)
