On minimum maximal distance-\(k\) matchings (Q509288): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2016.11.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2915515624
@@ Property / OpenAlex ID: W2915515624 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+Q4504901
@@ Property / cites work: Q4504901 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3340896
@@ Property / cites work: Q3340896 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability results for the maximum and minimum maximal induced matching problems
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+On the Maximum Independent Set Problem in Subclasses of Planar Graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:509288