Pages that link to "Item:Q5402563"
From MaRDI portal
The following pages link to On the completeness of a generalized matching problem (Q5402563):
Displayed 33 items.
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Packing in honeycomb networks (Q714696) (← links)
- Packing paths perfectly (Q757434) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Path-factors in the square of a tree (Q937248) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- On generalized matching problems (Q1149783) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Illuminating disjoint line segments in the plane (Q1434256) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- On the complexity of the \(k\)-customer vehicle routing problem (Q1886800) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- On the structure of self-complementary graphs (Q3439312) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)