A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (Q3899836): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-blocking polyhedra
@@ Property / cites work: Anti-blocking polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Properties of vertex packing and independence system polyhedra
+Normal rank
@@ Property / cites work @@
+Line perfect graphs
@@ Property / cites work: Line perfect graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01589347
+Normal rank
@@ Property / OpenAlex ID @@
+W2068244470
@@ Property / OpenAlex ID: W2068244470 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3899836