Pages that link to "Item:Q5009620"
From MaRDI portal
The following pages link to Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620):
Displaying 11 items.
- 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)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5091230) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
