Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Certain NP-complete matching problems

From MaRDI portal
Publication:794163
Jump to:navigation, search

DOI10.1016/0020-0255(84)90046-XzbMath0539.68033OpenAlexW2035422196MaRDI QIDQ794163

N. E. Zubov

Publication date: 1984

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(84)90046-x


zbMATH Keywords

NP-completenessdisjoint matchings decision problemNP-complete matching problems


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • NP-completeness of some generalizations of the maximum matching problem
  • The NP-completeness column: An ongoing gulde
  • The NP-completeness column: An ongoing guide
  • The NP-completeness column: An ongoing guide


This page was built for publication: Certain NP-complete matching problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:794163&oldid=12731177"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki