694 search results - page 46 / 139 » Open Graphs and Computational Reasoning |
AGTIVE
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper deals with knowledge-based computer aided design. A novel method giving additional support for conceptual design is presented. In this method, a designer firs...
ISCOPE
1999
Springer
14 years 2 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
IWOCA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
ICCS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...