Pages that link to "Item:Q1071037"

The following pages link to A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037):

Displayed 10 items.

• On existence theorems (Q686508) ‎ (← links)
• Max-cut in circulant graphs (Q1201272) ‎ (← links)
• Judicious partitions of graphs (Q1314903) ‎ (← links)
• Checking robust nonsingularity is NP-hard (Q1802197) ‎ (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) ‎ (← links)
• Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088) ‎ (← links)
• A survey of graph laplacians (Q4853923) ‎ (← links)
• (Q5202209) ‎ (← links)
• The cut cone. III: On the role of triangle facets (Q5905548) ‎ (← links)
• The cut cone. III: On the role of triangle facets (Q5919846) ‎ (← links)