Sciweavers

2473 search results - page 57 / 495
» The Logic of Communication Graphs
Sort
View
APAL
2005
93views more  APAL 2005»
13 years 7 months ago
Logical aspects of Cayley-graphs: the group case
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
Dietrich Kuske, Markus Lohrey
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 7 months ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 2 months ago
Random Walk on Directed Dynamic Graphs
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
Oksana Denysyuk, Luis Rodrigues
MOBICOM
2012
ACM
11 years 10 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
14 years 1 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...