Dulmage–Mendelsohn decomposition (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dulmage–Mendelsohn decomposition" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

low place

low place

102^nd place

76^th place

451^st place

277^th place

1sciencedirect.com

149^th place

178^th place

69^th place

59^th place

5^th place

5^th place

ams.org

mathscinet.ams.org

Harary, Frank; Plummer, Michael D. (1967), "On the core of a graph", Proceedings of the London Mathematical Society, Third Series, 17: 305–314, doi:10.1112/plms/s3-17.2.305, hdl:2027.42/135576, MR 0209184.

arxiv.org

Aigner-Horev, Elad; Segal-Halevi, Erel (2022-03-01). "Envy-free matchings in bipartite graphs and their applications to fair division". Information Sciences. 587: 164–187. arXiv:1901.09527. doi:10.1016/j.ins.2021.11.059. ISSN 0020-0255. S2CID 170079201.

doi.org

Dulmage, A. L. & Mendelsohn, N. S. (1958). "Coverings of bipartite graphs". Can. J. Math. 10: 517–534. doi:10.4153/cjm-1958-052-0. The original Dulmage–Mendelsohn paper
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. (2006-10-01). "Rank-maximal matchings". ACM Transactions on Algorithms. 2 (4): 602–610. doi:10.1145/1198513.1198520. S2CID 43243.
Harary, Frank; Plummer, Michael D. (1967), "On the core of a graph", Proceedings of the London Mathematical Society, Third Series, 17: 305–314, doi:10.1112/plms/s3-17.2.305, hdl:2027.42/135576, MR 0209184.
Aigner-Horev, Elad; Segal-Halevi, Erel (2022-03-01). "Envy-free matchings in bipartite graphs and their applications to fair division". Information Sciences. 587: 164–187. arXiv:1901.09527. doi:10.1016/j.ins.2021.11.059. ISSN 0020-0255. S2CID 170079201.

handle.net

hdl.handle.net

Harary, Frank; Plummer, Michael D. (1967), "On the core of a graph", Proceedings of the London Mathematical Society, Third Series, 17: 305–314, doi:10.1112/plms/s3-17.2.305, hdl:2027.42/135576, MR 0209184.

iitm.ac.in

cse.iitm.ac.in

"Dulmage Mendelsohn Decomposition" (PDF).

sciencedirect.com

Aigner-Horev, Elad; Segal-Halevi, Erel (2022-03-01). "Envy-free matchings in bipartite graphs and their applications to fair division". Information Sciences. 587: 164–187. arXiv:1901.09527. doi:10.1016/j.ins.2021.11.059. ISSN 0020-0255. S2CID 170079201.

semanticscholar.org

api.semanticscholar.org

Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. (2006-10-01). "Rank-maximal matchings". ACM Transactions on Algorithms. 2 (4): 602–610. doi:10.1145/1198513.1198520. S2CID 43243.
Aigner-Horev, Elad; Segal-Halevi, Erel (2022-03-01). "Envy-free matchings in bipartite graphs and their applications to fair division". Information Sciences. 587: 164–187. arXiv:1901.09527. doi:10.1016/j.ins.2021.11.059. ISSN 0020-0255. S2CID 170079201.

worldcat.org

Aigner-Horev, Elad; Segal-Halevi, Erel (2022-03-01). "Envy-free matchings in bipartite graphs and their applications to fair division". Information Sciences. 587: 164–187. arXiv:1901.09527. doi:10.1016/j.ins.2021.11.059. ISSN 0020-0255. S2CID 170079201.