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.
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph S/sub k/(G) which has for vertices all the k-subsets of E(G), and two vertices S and T are adjacent whenever there exist sϵS and tϵT such that s and t share a common vertex. In the super line multigraph L/sub k/(G) we have an adjacency for each such occurrence. We give a formula to find the adjacency...
Compact routing protocols are used to reduce the routing table size at the cost of the optimality of the computed (shortest) paths. Interval routing (IR) is a compact routing scheme, where nodes are labeled with unique integers from a continuous range, and the outgoing arcs in every node are labeled with a set of intervals forming a partition of the range. Pivot interval routing (PIR) applies IR to...
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.