Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1431747

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

zbMATH Open0935.05073MaRDI QIDQ4948670FDOQ4948670


Authors: P. V. Efremov Edit this on Wikidata


Publication date: 13 April 2000



Title of this publication is not available (Why is that?)



Recommendations

  • Partitions of complete bipartite geometric graphs into plane perfect matchings
  • scientific article; zbMATH DE number 3914366
  • Computing fair and bottleneck matchings in geometric graphs
  • Geometry Helps in Matching
  • Compatible geometric matchings


zbMATH Keywords

matchingalgorithmpermutation graph


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)



Cited In (6)

  • A geometric theory for hypergraph matching
  • Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
  • Partitions of complete bipartite geometric graphs into plane perfect matchings
  • Title not available (Why is that?)
  • Maximum matchings in geometric intersection graphs
  • Bipartite matching and Van der Waerden conjecture





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 Q4948670)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4948670&oldid=19371080"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 08:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki