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.
Dominating Tree Problem (DTP) aims to find a dominating tree (dTree) of minimum cost on a given connected, undirected and weighted graph in such a way that a vertex in the graph is either in dTree or adjacent to a vertex in dTree. A solution (dTree) to this problem can be used as routing backbone in wireless sensor network. Being a NP $\mathcal {NP}$-Hard problem, several problem-specific heuristics...
Given a connected, undirected graph G = (V,E), where V is the set of vertices and E is the set of edges, the clique partitioning problem (CPP) seeks on this graph a partition of set V into minimum number of subsets such that each subset is a clique. The CPP is an N P -Hard problem and finds numerous practical applications in diverse domains like digital design synthesis, clustering...
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.