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

A matching algorithm for regular bipartite graphs

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

DOI10.1016/0166-218X(92)90244-5zbMath0752.68061MaRDI QIDQ1186308

László Lovász, Judit Csima

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

bipartite graphsperfect matching


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items

Dating to marriage ⋮ A simple matching algorithm for regular bipartite graphs.



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Matching theory
  • A class of counterexamples on permanents
  • College Admissions and the Stability of Marriage


This page was built for publication: A matching algorithm for regular bipartite graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1186308&oldid=12049748"
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 01:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki