Matching (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Matching (graph theory)" in English language version.

refsWebsite

Global rank English rank

12doi.org

2^nd place

2arxiv.org

69^th place

59^th place

2semanticscholar.org

11^th place

8^th place

2psu.edu

207^th place

136^th place

1networkx.org

low place

1diestel-graph-theory.com

low place

1ams.org

451^st place

277^th place

1uoa.gr

9,203^rd place

low place

1kth.se

low place

8,363^rd place

1harvard.edu

18^th place

17^th place

1tugraz.at

low place

1nih.gov

4^th place

1berkeley.edu

580^th place

462^nd place

ams.org

mathscinet.ams.org

Cameron, Kathie (1989), "Induced matchings", Special issue for First Montreal Conference on Combinatorics and Computer Science, 1987, Discrete Applied Mathematics, 24 (1–3): 97–102, doi:10.1016/0166-218X(92)90275-F, MR 1011265

arxiv.org

Keivan Hassani Monfared and Sudipta Mallik, Theorem 3.6, Spectral characterization of matchings in graphs, Linear Algebra and its Applications 496 (2016) 407–419, https://doi.org/10.1016/j.laa.2016.02.004, https://arxiv.org/abs/1602.03590
Callan, David (2009), A combinatorial survey of identities for the double factorial, arXiv:0906.1317, Bibcode:2009arXiv0906.1317C.

berkeley.edu

people.eecs.berkeley.edu

Karp, Richard M.; Vazirani, Umesh V.; Vazirani, Vijay V. (1990). "An optimal algorithm for on-line bipartite matching" (PDF). Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC 1990). pp. 352–358. doi:10.1145/100216.100262. ISBN 0-89791-361-2.

diestel-graph-theory.com

"Preview".

doi.org

Cameron, Kathie (1989), "Induced matchings", Special issue for First Montreal Conference on Combinatorics and Computer Science, 1987, Discrete Applied Mathematics, 24 (1–3): 97–102, doi:10.1016/0166-218X(92)90275-F, MR 1011265
Keivan Hassani Monfared and Sudipta Mallik, Theorem 3.6, Spectral characterization of matchings in graphs, Linear Algebra and its Applications 496 (2016) 407–419, https://doi.org/10.1016/j.laa.2016.02.004, https://arxiv.org/abs/1602.03590
Fredman, Michael L.; Tarjan, Robert Endre (1987), "Fibonacci heaps and their uses in improved network optimization algorithms", Journal of the ACM, 34 (3): 596–615, doi:10.1145/28869.28874, S2CID 7904683
Yannakakis, Mihalis; Gavril, Fanica (1980), "Edge dominating sets in graphs" (PDF), SIAM Journal on Applied Mathematics, 38 (3): 364–372, doi:10.1137/0138030.
Bezáková, Ivona; Štefankovič, Daniel; Vazirani, Vijay V.; Vigoda, Eric (2008). "Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems". SIAM Journal on Computing. 37 (5): 1429–1454. CiteSeerX 10.1.1.80.687. doi:10.1137/050644033. S2CID 755231.
Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, doi:10.1089/cmb.2005.12.1004, PMID 16201918.
Rabin, Michael O.; Vazirani, Vijay V. (1989), "Maximum matchings in general graphs through randomization", Journal of Algorithms, 10 (4): 557–567, CiteSeerX 10.1.1.228.1996, doi:10.1016/0196-6774(89)90005-9
Cheriyan, Joseph (1997), "Randomized ${\widetilde {O}}(M(|V|))$ algorithms for problems in matching theory", SIAM Journal on Computing, 26 (6): 1635–1655, doi:10.1137/S0097539793256223
Tassa, Tamir (2012), "Finding all maximally-matchable edges in a bipartite graph", Theoretical Computer Science, 423: 50–58, doi:10.1016/j.tcs.2011.12.071
Karp, Richard M.; Vazirani, Umesh V.; Vazirani, Vijay V. (1990). "An optimal algorithm for on-line bipartite matching" (PDF). Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC 1990). pp. 352–358. doi:10.1145/100216.100262. ISBN 0-89791-361-2.
Mahdian, Mohammad; Yan, Qiqi (2011). "Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs". Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing. pp. 597–606. doi:10.1145/1993636.1993716.
See, e.g., Trinajstić, Nenad; Klein, Douglas J.; Randić, Milan (1986), "On some solved and unsolved problems of chemical graph theory", International Journal of Quantum Chemistry, 30 (S20): 699–742, doi:10.1002/qua.560300762.

harvard.edu

ui.adsabs.harvard.edu

Callan, David (2009), A combinatorial survey of identities for the double factorial, arXiv:0906.1317, Bibcode:2009arXiv0906.1317C.

kth.se

nada.kth.se

Ausiello, Giorgio; Crescenzi, Pierluigi; Gambosi, Giorgio; Kann, Viggo; Marchetti-Spaccamela, Alberto; Protasi, Marco (2003), Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer. Minimum edge dominating set (optimisation version) is the problem GT3 in Appendix B (page 370). Minimum maximal matching (optimisation version) is the problem GT10 in Appendix B (page 374). See also Minimum Edge Dominating Set and Minimum Maximal Matching in the web compendium.

networkx.org

"is_matching". NetworkX 2.8.2 documentation. Retrieved 2022-05-31. Each node is incident to at most one edge in the matching. The edges are said to be independent.

nih.gov

pubmed.ncbi.nlm.nih.gov

Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, doi:10.1089/cmb.2005.12.1004, PMID 16201918.

psu.edu

citeseerx.ist.psu.edu

Bezáková, Ivona; Štefankovič, Daniel; Vazirani, Vijay V.; Vigoda, Eric (2008). "Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems". SIAM Journal on Computing. 37 (5): 1429–1454. CiteSeerX 10.1.1.80.687. doi:10.1137/050644033. S2CID 755231.
Rabin, Michael O.; Vazirani, Vijay V. (1989), "Maximum matchings in general graphs through randomization", Journal of Algorithms, 10 (4): 557–567, CiteSeerX 10.1.1.228.1996, doi:10.1016/0196-6774(89)90005-9

semanticscholar.org

api.semanticscholar.org

Fredman, Michael L.; Tarjan, Robert Endre (1987), "Fibonacci heaps and their uses in improved network optimization algorithms", Journal of the ACM, 34 (3): 596–615, doi:10.1145/28869.28874, S2CID 7904683
Bezáková, Ivona; Štefankovič, Daniel; Vazirani, Vijay V.; Vigoda, Eric (2008). "Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems". SIAM Journal on Computing. 37 (5): 1429–1454. CiteSeerX 10.1.1.80.687. doi:10.1137/050644033. S2CID 755231.

tugraz.at

math.tugraz.at

Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, doi:10.1089/cmb.2005.12.1004, PMID 16201918.

uoa.gr

cgi.di.uoa.gr

Yannakakis, Mihalis; Gavril, Fanica (1980), "Edge dominating sets in graphs" (PDF), SIAM Journal on Applied Mathematics, 38 (3): 364–372, doi:10.1137/0138030.