9532 search results - page 85 / 1907 » Logic, Graphs, and Algorithms |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
77
Voted
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
IJON
2010
14 years 9 months ago
2010
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
107
click to vote
ECAI
2010
Springer
15 years 9 days ago
2010
Springer
Abstract. We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time tem...
ESOP
2000
Springer
15 years 2 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...