Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
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...
From a user's perspective, hypertext links on the web form a directed graph between distinct information sources. We investigate the effects of discovering "backlinks&qu...
Soumen Chakrabarti, David Gibson, Kevin S. McCurle...
We overview three kinds of possibilistic graphical models (based on directed acyclic graphs) and present, how they can be expressed by means of non-graphical approach to multidimen...