9532 search results - page 140 / 1907 » Logic, Graphs, and Algorithms |
WDAG
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
ALGORITHMICA
2004
14 years 11 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
CADE
2004
Springer
15 years 11 months ago
2004
Springer
FUZZY
2004
Springer
15 years 4 months ago
2004
Springer
JAPLL
2010
14 years 9 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...