scientific article; zbMATH DE number 434914
From MaRDI portal
Publication:3139770
zbMATH Open0801.68066MaRDI QIDQ3139770FDOQ3139770
Authors: Michael D. Plummer 
Publication date: 29 November 1994
Title of this publication is not available (Why is that?)
Recommendations
- On the vertex packing problem
- The complexity of perfect matchings and packings in dense hypergraphs
- Packing $k$-Matchings and $k$-Critical Graphs
- The complexity of perfect packings in dense graphs
- Matching and \(P _{2}\)-packing: weighted versions
- On Counting Parameterized Matching and Packing
- The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
- On the complexity of digraph packings
- scientific article; zbMATH DE number 3976364
- Hardness and approximation of minimum maximal matchings
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (11)
- The computational complexity of graph problems with succinct multigraph representation
- An NC algorithm for the perfect matching problem in larger cycle-free graphs
- Title not available (Why is that?)
- Generalized subgraph-restricted matchings in graphs
- Title not available (Why is that?)
- Matching theory -- a sampler: From Dénes König to the present
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
- Computational complexity of existence problems for matchings in graphs.
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Title not available (Why is that?)
- On the complexity of a family of generalized matching problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139770)
