Pages that link to "Item:Q4511245"

The following pages link to Approximation Algorithms for Some Graph Partitioning Problems (Q4511245):

Displaying 7 items.

• Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
• Generalized \(k\)-multiway cut problems (Q2504075) (← links)
• Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
• Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
• OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations (Q3091376) (← links)
• Scalable Algorithms for Multiple Network Alignment (Q5009904) (← links)
• Finding a Small Number of Colourful Components (Q5088911) (← links)