The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The enumeration of spanning trees in a finite graph is an important problem related to various domains of mathematics, physics and network reliability that has been investigated by many researchers. A network N is called a closed chain of planar networks if its modelling is defined by n planar graphs connected by articulation points. Some recent studies focus on finding the number of spanning trees...
The number of spanning trees of a map C is the total number of distinct spanning subgraphs of C that are trees. In this paper, we give some methods to facilitate the calculation of the number of spanning trees for planar maps and derive several simple formulas for the number of spanning trees of special families of maps called (n-Tent chains, n-Home chains, n-Kite chains, n-Envelope chains).
Generation of all the spanning trees of a graph has been a challenge for analysis of the network. Research scholars had proposed several methods. The generalized and most simple method of them was based on Incidence matrix. A new approach has been proposed in this paper, which makes use of fundamental cut set matrix of the network. Two new matrices are also defined based on incidence and cut-set matrix...
This paper describes a genetic algorithm (GA) developed for the reconfiguration of radial distribution systems. The reconfiguration is treated as an optimization problem of combinatory nature, where the aim is to obtain a configuration with minimal power losses, iterations and also with some distribution system restrictions. The initial population of the GA is obtained using spanning trees techniques...
Here we describe the application of two well known graph algorithms, Edmonds' algorithm and Prim's algorithm, to the problem of optimizing distributed SPARQL queries. In the context of this paper, a ldquodistributed SPARQL queryrdquo is a SPARQL query which is resolved by contacting any number of remote SPARQL endpoints. Two optimization approaches are described. In the first approach, a static query...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.