886 search results - page 70 / 178 » Reasoning with contextual graphs |
145
Voted
AGTIVE
2003
Springer
15 years 9 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...
133
click to vote
ISCOPE
1999
Springer
15 years 8 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...
119
click to vote
CPC
2007
15 years 4 months ago
2007
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
218
click to vote
GIS
2006
ACM
16 years 5 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
143
click to vote
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...