Pages that link to "Item:Q5402563"
From MaRDI portal
The following pages link to On the completeness of a generalized matching problem (Q5402563):
Displaying 50 items.
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- 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)
- The labeled maximum matching problem (Q1000970) (← 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)
- On the complexity of a family of generalized matching problems (Q1068535) (← 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)
- Optimal general matchings (Q1627167) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← 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)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules (Q2171596) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- On a conjecture by Gale about one-sided matching problems (Q2277345) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
- Covering tree with stars (Q2354301) (← links)
