Pages that link to "Item:Q3899836"

The following pages link to A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (Q3899836):

Displaying 21 items.

• Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
• Stability number of bull- and chair-free graphs (Q1208469) (← links)
• The maximum clique problem (Q1318271) (← links)
• An exact algorithm for the maximum stable set problem (Q1328431) (← links)
• On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
• Polyhedral characterizations and perfection of line graphs (Q1382259) (← links)
• Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
• The list chromatic index of simple graphs whose odd cycles intersect in at most one edge (Q1690237) (← links)
• Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• Tuza's conjecture for graphs with maximum average degree less than 7 (Q2349964) (← links)
• On the vertex packing problem (Q2366214) (← links)
• (Q3115591) (← links)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) (← links)
• Determining the number of internal stability of a graph (Q3960887) (← links)
• An algorithm for the maximum internally stable set in a weighted graph (Q3968462) (← links)
• New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths (Q4558286) (← links)
• A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
• New cases of polynomial solvability of the independent set problem for graphs with forbidden triods (Q6078549) (← links)