Sciweavers

248 search results - page 47 / 50
» On the Cayley isomorphism problem
Sort
View
KI
2005
Springer
15 years 5 months ago
Dependency Calculus: Reasoning in a General Point Relation Algebra
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
Marco Ragni, Alexander Scivos
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 4 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
JCT
2006
100views more  JCT 2006»
14 years 11 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
ANOR
2005
160views more  ANOR 2005»
14 years 11 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
APAL
2002
101views more  APAL 2002»
14 years 11 months ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze