[2] viXra:2202.0183 [pdf] submitted on 2022-02-28 22:17:38
Authors: Vishal Pandey, Dhiraj Ojha
Comments: 3 Pages.
In Graph Theory, there is a concept of the matching the graph and the covering of edge I haveto find the relation between both of them however there is no restriction which specifications we have to take either maximum
matching or minimum edge cover and maximum edge coveror minimum matching and any other like perfect matching. I had taken a simple and a adjustable set functions of (maximum and minimum) which will be helpful in the counter partof the calculations. The assumption which we have taken is maximum graph matching and minimal edge cover in the arbitrary graph. After doing all the calculations for this situation which we have taken we got the sum of the maximum matching and minimum edge cover is less than equal to the vertices.
Category: Data Structures and Algorithms
[1] viXra:2202.0017 [pdf] submitted on 2022-02-03 20:07:38
Authors: Amey Thakur, Mega Satish
Comments: 6 pages, 5 figures, Volume 10, Issue I, International Journal for Research in Applied Science and Engineering Technology (IJRASET), 2022. DOI: https://doi.org/10.22214/ijraset.2022.40066
The purpose of this paper is to introduce the Julia programming language with a concentration on Text Summarization. An extractive summarization algorithm is used for summarizing. Julia's evolution and features, as well as comparisons to other programming languages, are briefly discussed. The system's operation is depicted in a flow diagram, which illustrates the processes of sentence selection.
Category: Data Structures and Algorithms