z-logo
open-access-imgOpen Access
An o(n<sup>2.5</sup>) Algorithm: For Maximum Matchings in General Graphs
Author(s) -
Yingtai Xie
Publication year - 2018
Publication title -
journal of applied mathematics and physics
Language(s) - English
Resource type - Journals
eISSN - 2327-4379
pISSN - 2327-4352
DOI - 10.4236/jamp.2018.69152
Subject(s) - bipartite graph , combinatorics , mathematics , discrete mathematics , simple (philosophy) , algorithm , graph , philosophy , epistemology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom