9532 search results - page 79 / 1907 » Logic, Graphs, and Algorithms |
WG
2005
Springer
15 years 4 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
ESA
2003
Springer
15 years 4 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
106
click to vote
CSFW
1999
IEEE
15 years 3 months ago
1999
IEEE
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
SIAMCOMP
2008
14 years 11 months ago
2008
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
AAAI
2000
15 years 16 days ago
2000
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...