Sciweavers

828 search results - page 62 / 166
» Simplicial Powers of Graphs
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
CP
2009
Springer
14 years 9 months ago
Same-Relation Constraints
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
Christopher Jefferson, Karen E. Petrie, Meinolf Se...
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 8 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
SC
2009
ACM
14 years 3 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan
LATA
2009
Springer
14 years 3 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle