Pages that link to "Item:Q1719617"

The following pages link to Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617):

Displaying 8 items.

• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
• On the maximum small-world subgraph problem (Q2327623) (← links)
• On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
• On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
• On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
• Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)