The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Abstract. In the world of living creatures, "simple minded" animals often cooperate to achieve common goals with amazing performance. One can consider this idea in the co...
Israel A. Wagner, Yaniv Altshuler, Vladimir Yanovs...
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
The paper presents a comparative study on the performance of commonly used estimators of the fractional order of integration when data is contaminated by noise. In particular, meas...
This paper presents a methodology for knowledge acquisition from source code. We use data mining to support semiautomated software maintenance and comprehension and provide practi...