The following pages link to (Q4608071):
Displaying 15 items.
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Fast approximation and exact computation of negative curvature parameters of graphs (Q2664113) (← 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)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5090996) (← links)
- (Q5091021) (← links)
- (Q5091230) (← links)
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs (Q5115790) (← 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)
