Pages that link to "Item:Q1071037"
From MaRDI portal
The following pages link to A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037):
Displaying 19 items.
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- On existence theorems (Q686508) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Max-cut in circulant graphs (Q1201272) (← links)
- Judicious partitions of graphs (Q1314903) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088) (← links)
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP (Q4327639) (← links)
- A survey of graph laplacians (Q4853923) (← links)
- Voting Procedures, Complexity of (Q5150301) (← 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)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
- Bounds on maximum weight directed cut (Q6606913) (← links)
