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 perfect matchings in graphs that have the two properties of being robust as well as recoverable; where robust means that the failure of a set of not too many edges of can be compensated, and recoverable means that this compensation can be done in an efficient way, that is, has a perfect matching for which the symmetric difference of and is small. We establish...
For
\documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document} \end{document}
and \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document} \end{document}, the distance graph P has vertex set {0,1,…,n − 1} and edge set {ij | 0 ≤ i,j ≤ n − 1,|j − i| ∈ D}. The class of distance graphs generalizes...
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.