Computational complexity of existence problems for matchings in graphs.

MaRDI QIDQ2756482zbMATH OpenFDO

Authors Jorge L. Arocha

Publication date 12 November 2001

Published in Revista Investigación Operacional (Search for Journal in Brave)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On complexity of special maximum matchings constructing
• On the completeness of a generalized matching problem
• scientific article; zbMATH DE number 434914
• Complexity of matching problems
• Certain NP-complete matching problems

Cited in

(6)

• On the complexity of a family of generalized matching problems
• Complexity of matching problems
• On the completeness of a generalized matching problem
• Computational complexity of simultaneous elementary matching problems
• Certain NP-complete matching problems
• On complexity of special maximum matchings constructing

This page was built for publication: Computational complexity of existence problems for matchings in graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2756482)