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.
We study the problem of estimating the size of a matching when the graph is revealed in a streaming fashion. Our results are multifold: 1. We give a tight structural result relating the size of a maximum matching to the arboricity $$\alpha $$ α of a graph, which has been one of the most studied graph parameters for matching algorithms in data streams. One of the implications is an algorithm...
Ordered Binary Decision Diagrams (OBDDs) are a popular data structure for Boolean functions. Given the rapid growth of application-based networks, an heuristic approach to deal with very large structured graphs are implicit OBDD-based graph algorithms. Vertices of an input graph are binary encoded and the edge set is represented by its characteristic function. Since OBDDs are able to take advantage...
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.