2503 search results - page 75 / 501 » A study of 3-arc graphs |
184
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
186
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
160
click to vote
TPDS
2010
15 years 4 months ago
2010
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
145
click to vote
IAT
2009
IEEE
16 years 22 days ago
2009
IEEE
—We present the STORIES methods and tool for (a) an abstracted story representation from a collection of time-indexed documents; (b) visualising it in a way that encourages users...
152
click to vote
DM
2006
15 years 6 months ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...