2283 search results - page 297 / 457 » Bounds of Graph Characteristics |
FUIN
2007
13 years 8 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
KI
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...