Pages that link to "Item:Q5111261"
From MaRDI portal
The following pages link to The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261):
Displaying 15 items.
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Temporal matching (Q2285132) (← 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)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- (Q5091021) (← links)
- (Q5091230) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
