The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...